+Depth First Search is a graph traversal algorithm that explores deeply along each branch. It ventures as far as possible from a starting [Node](/wiki/node) before backtracking, exhaustively searching each path within a [Graph](/wiki/graph). This method systematically uncovers connections and components.
+## See also
+- [Breadth First Search](/wiki/breadth_first_search)
+- [Graph Traversal](/wiki/graph_traversal)
+- [Tree](/wiki/tree)
... 1 more lines