Agent Engineering
Depth-First Search
Depth-first search explores one branch of a graph as far as its rules allow before backtracking to unexplored alternatives. A visited set can prevent repeated node exploration in cyclic graphs. Its discovery order depends on neighbor ordering and is not generally a minimum-hop or minimum-cost path order.
Also called: DFS
Reviewed
Sources
Member lesson
The definition and sources are public. The complete practical lesson is for members.