Depth-First Search (DFS)

Explores a graph deeply along each branch before backtracking, often implemented using recursion.

Category: graph

Enjoy reading code with a tandem explainer?

Explain code with DocComment! Try out your own code!