Strongly Connected Components
Authors: Benjamin Qi, Dong Liu
Subsets of nodes in directed graphs where each node in a subset can reach each other node in the subset.
Focus Problem – read through this problem before continuing!
Solution - Planets and Kingdoms
Then assign each component an (starting from ).
Using Kosaraju's SCC
Using Tarjan's SCC
(KACTL at most one?)
Join the USACO Forum!
Stuck on a problem, or don't understand a module? Join the USACO Forum and get help from other competitive programmers!