Depth-First Search (DFS)
DFS
A graph traversal algorithm that explores as far as possible along each branch before backtracking. It uses a stack or recursion to keep track of visited nodes, systematically exploring paths until all reachable nodes are examined.
9 connections Built by Tim Jones