depth-first search

E2171558 UNEXPLORED

Depth-first search is a graph traversal algorithm that explores as far as possible along each branch before backtracking, commonly used as a building block in many graph algorithms.

Try in SPARQL Jump to: Surface forms Referenced by

All labels observed (1)

Label	Occurrences
depth-first search canonical	1

Referenced by (1)

Full triples — surface form annotated when it differs from this entity's canonical label.

Kosaraju's algorithm → usesTraversal → depth-first search ⓘ