Category:Depth-first search

From LiteratePrograms

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.

Articles in category "Depth-first search"

There are 3 articles in this category.

D

• Depth-first search (C Plus Plus)

J

• Depth-first search (Java)

P

• Depth-first search (Python)