Freaks City

Strongly Connected Components A strongly connected component in a directed graph is a maximal subgraph where every pair of vertices can reach eachother. To find SCCs, Tarjan's algorithm uses depth-first search (DFS) and maintains two key arrays: disc (discovery time) and low (lowest discovery time reachable from the current vertex). The algorit ...