Hi, How does the Component dfs exactly work without the starting point?

#1

He did not specify any starting point in the graph, how did it run despite doing that?

#2

these are the basic steps:

  1. Initialize all vertices as not visited.
  2. Do following for every vertex ‘node’.
    (a) If ‘node’ is not visited before, call dfs_helper(node)
    (b) Print new line character

dfs_helper(v)

  1. Mark ‘node’ as visited.
  2. Print ‘node’
  3. Do following for every adjacent ‘u’ of ‘node’.
    If ‘u’ is not visited, then recursively call dfs_helper(u)