Live Batches
Masterclasses
Menu
Free Courses
Account
Login / Sign Up

DFS Traversal

Easy Acceptance 85.64% Points 20.00

You are given a graph with V vertices and its adjacency list. Starting from vertex 0, perform a Depth First Search (DFS) traversal and return the order in which the vertices are visited.

Examples
Example 1

image Input: V = 5, adj = [[1,2],[0,3],[0,4],[1],[2]]
Output: [0,1,3,2,4]
Explanation: The vertices are visited using Depth First Search starting from vertex 0.

Example 2

image Input: V = 3, adj = [[1],[0,2],[1]]
Output: [0,1,2]
Explanation: DFS visits all reachable vertices.

Example 3

image Input: V = 1, adj = [[]]
Output: [0]
Explanation: The graph contains only one vertex.

Constraints
    • 1 = V = 105
    • 0 = E = 2 × 105
Companies
Samsung Wipro
Topics
Graph DFS Traversal
Solution.cs C#JavaPythonC++Javascript

Unlock the code editor

Sign in to write, run, and submit your solution against the full test suite.

  • Run code against sample & hidden test cases
  • Save submissions and track your streak
  • Compare with editorial & community solutions