Category:Depth-first search

From LiteratePrograms
Jump to: navigation, search

This category contains implementations of depth-first search, a simple graph search algorithm. Compared to breadth-first search, it is more space efficient but doesn't always find the shortest path.

Pages in category "Depth-first search"

The following 3 pages are in this category, out of 3 total.