• Strongly connected components (SCCs) can be though of as self-contained cycles within a directed graph where every vertex in a given cycle can reach every other vertex in the same cycle

Find Strongly Connected Components

• [[Kosaraju’s Algorithm]]