Write a program that performs Depth First Search in a graph.
Take an integer from the terminal as an extra input. Do the DFS, starting from this vertex.
Output Format The output must contain exactly N integers on a single line - the sequence of vertex labels, in the order they are visited.
Sample Output (start at 0) 0 1 2 3 4