Depth-first search
![](/Images/godic/202501/08/Depth-first-tree.svg5507.png")
![](/Images/godic/202501/08/Graph.traversal.example.svg5508.png")
![The four types of edges defined by a spanning tree](/Images/godic/202501/08/Tree_edges.svg5508.png")
![](/Images/godic/202501/08/If-then-else-control-flow-graph.svg5508.png")
Depth-first search (DFS) is an algorithm for traversing or searching tree or graph data structures. One starts at the root (selecting some arbitrary node as the root in the case of a graph) and explores as far as possible along each branch before backtracking.