Geeksforgeeks

Error

×

Leaderboard

Showing:

Handle | Score |
---|---|

@Ibrahim Nash | 6420 |

@blackshadows | 6376 |

@mb1973 | 5578 |

@Quandray | 5231 |

@akhayrutdinov | 5111 |

@saiujwal13083 | 4510 |

@sanjay05 | 3762 |

@kirtidee18 | 3673 |

@marius_valentin_dragoi | 3522 |

@sushant_a | 3459 |

@verma_ji | 3412 |

Complete Leaderboard | |

Handle | Score |

@codersgroup18 | 714 |

@Manikanta punnam | 579 |

@sriramgoparaju99 | 532 |

@yashkaril4 | 517 |

@praveenbgp6 | 517 |

@prankursharma31 | 489 |

@rdakka | 465 |

@sonamnigam1999 | 441 |

@purohitmn02 | 427 |

@sonamkumari63928 | 426 |

@ShubhankarPandey | 419 |

Complete Leaderboard |

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 3Explanation: 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 starting from 0, it will go to 1 then 2 then 4, and then from 4 to 3. Thus dfs will be 0 1 2 4 3.

**Example 2:**

Input:Output:0 1 2 3Explanation: 0 is connected to 1 , 3. 1 is connected to 2. 2 is connected to 1. 3 is connected to 0. so starting from 0, it will go to 1 then 2 then back to 0 then 0 to 3 thus dfs will be 0 1 2 3.

**Your task:**

You don’t need to read input or print anything. Your task is to complete the function **dfsOfGraph()** which takes the integer V denoting the number of vertices and adjacency list as input parameters and returns a list containing the DFS traversal of the graph starting from the 0th vertex from left to right according to the graph.

**Expected Time Complexity: **O(V + E)

**Expected Auxiliary Space: **O(V)

**Constraints:**

1 ≤ V, E ≤ 10^{4}

Login to report an issue on this page.

We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?

Yes
DFS of Graph

...