Depth First Search is a graph traversal algorithm that explores deeply along each branch. It ventures as far as possible from a starting Node before backtracking, exhaustively searching each path within a Graph. This method systematically uncovers connections and components.
See also