**DFS of Graph | Practice | GeeksforGeeks**
https://practice.geeksforgeeks.org/problems/depth-first-traversal-for-a-graph/1

Given a connected undirected graph. Perform a Depth First Traversal of the graph. Note: Use recursive approach to find the DFS traversal of the graph starting from the 0th vertex from left to right according to the graph.. Example 1: Input: Output: 0 1 2 4 3 Explanation: 0 is connected to 1, 2, 4. 1 is connected to 0. 2 is connected to 0. 3 is connected to 0. 4 is connected to 0, 3. so ...

**DA:** 55 **PA:** 74 **MOZ Rank:** 23