Strongly Connected Components
← Back to Graph Algorithms
Maximal subsets of vertices in a directed graph where every vertex is reachable from every other vertex in the subset. Identifying SCCs is important for understanding the structure of directed graphs.
Key Properties
Related
- Traversal (SCC algorithms rely on DFS)