Least You Need to Know: Strongly Connected Components and Mutual Reachability
เปิดบทเรียน
A strongly connected component in a directed graph is a maximal set of vertices that can all reach one another. SCCs reveal the graph's cyclic cores and compress repeated mutual-reachability structure into components.