Depth first search is a tree and graph search and traversal method frequently encountered and often used as a building block to more complex algorithms.
What is Depth First Search?
Depth first search is a tree and graph searc
A look at the breadth first search algorithm, and its application in graphs for finding single source shortest paths.