Topic: Graph Traversal: BFS and DFS

The Parenthesis Theorem for DFS Intervals

Tarjan’s Algorithm: Correctness and Linear-Time Bound

Tarjan’s Low-Link Values and Stack Invariant

Strongly Connected Components and the Condensation DAG

Search Forests and Discovery States

Queue Discipline and BFS Invariants

Parent Pointers as Shortest-Path Certificates

Multi-Source BFS and Nearest-Source Queries

Kosaraju Trace Workshop and Transpose Pitfalls

Kosaraju’s Two-Pass Algorithm and Its Correctness