Depth-first search

Related terms

• Breadth-first search — Visiting a tree or graph level by level, nearest nodes first, using a queue. It finds shortest paths in unweighted graphs.
• Stack — A last-in, first-out collection: you only push and pop at one end. Typical uses are undo history, bracket matching and the call stack.
• Graph — A set of vertices (nodes) connected by edges. Edges can be directed or undirected. Networks, maps, dependencies and friendships are all graphs.

← All terms