2 docs tagged with "Graph Algorithms"

Learn the Breadth-First Search (BFS) pattern from first principles, including level-order traversal, shortest path intuition, graph exploration, complexity analysis, and real-world engineering applications.

Learn Depth-First Search (DFS) from first principles: recursive exploration, graph and tree traversal, backtracking, complexity analysis, and real engineering applications in compilers, databases, and distributed systems.