Skip to content
Free public beta until December 4, 2026: every course is open, no card needed. After that, the first chapter of each course stays free and full access is a one-time $39 ($19 for up to 100 founding members chosen for helpful feedback). Your progress is kept. How the beta works

strongly connected components

The largest groups of vertices in a directed graph where every vertex can reach every other vertex in the same group by following directed edges.

A strongly connected component (SCC) of a directed graph is a maximal set of vertices such that every vertex can reach every other vertex within the set via directed paths.

See also

topological sorting
Read the full section →
Graph settings

Calculator