Kosaraju SCC Algorithm and Component DAGs

Lecture 34 of CS502 Fundamentals of Algorithms presents Kosaraju's algorithm, an extraordinarily elegant two-pass depth-first search algorithm that computes all strongly connected components of a directed graph in linear O(|V| + |E|) time. The algorithm proceeds in three straightforward steps: 1) Call DFS on graph G to compute the finishing times f[u] for all vertices; 2) Compute the transpose graph G^T; 3) Call DFS on G^T, but in the main loop of DFS, process vertices in order of decreasing finishing times computed in step 1. The lecture proves why this works: the vertex with the highest finishing time in G is guaranteed to belong to a 'source' component in the component DAG G_SCC. When transposed in G^T, that source component becomes a 'sink' component with no outgoing edges to other components. Therefore, the second DFS starting at this vertex traverses exactly its own component without leaking into others, isolating each SCC cleanly into a separate DFS tree. Key concepts such as optimal substructure, overlapping subproblems, and memoization tables are thoroughly demystified. The lecture details classical algorithmic design techniques demonstrated across standard benchmark problems in computer science. Structured recurrence solving methodologies are demonstrated using the substitution method, recursion tree analysis, and the Master theorem. Algorithmic decision boundaries and lower-bound complexity proofs are evaluated alongside practical runtime performance characteristics. Graph representations are explored through adjacency matrices, adjacency lists, and memory footprint considerations in sparse and dense topologies. Breadth-first and depth-first search mechanics, discovery and finishing timestamps, and edge classifications are systematically analyzed. Greedy strategies including Huffman prefix tree generation and activity scheduling are rigorously proven using exchange arguments. Scholars examine shortest path optimality conditions, edge relaxation properties, and negative cycle detection algorithms. Minimum spanning tree algorithms including Kruskal and Prim formulations are analyzed alongside union-find disjoint set operations. Computational complexity concepts are illustrated through polynomial-time verification, decision reductions, and NP-completeness proofs. By engaging with solved past papers by Moaaz and Waqar Siddhu, learners gain actionable insights into recurrent university exam questions.