Depth-first search

Depth-first search (DFS) search inside a graph by exploring as far as possible along each branch before backtracking.

Resources

• Depth-first search visualization – David Galles
• Depth-first search in 4 minutes – Youtube