Depth-First Search (DFS)

Given a graph, perform a depth-first traversal starting from a specified vertex. Return the order in which vertices are visited.

Loading...