Strongly Connected Components
A subgraph is strongly connected if every vertex in the subgraph is reachable from every other vertex (the trivial SCC is a single vertex.) This problem aims to form a partition of an arbitrary directed graph into subgraphs that are themselves strongly connected.
SCC
Strongly Connected Components
22 Algorithms
CCI
Connected Components in an undirected graph
35 Algorithms
TC
Transitive Closure
7 Algorithms
BC
Biconnected Components
1 Algorithms
TCO
Transitive Closure of a symmetric Boolean matrix
1 Algorithms
- Strongly Connected Components
- CCIConnected Components in an undirected graph
35 Algorithms
- TCTransitive Closure
7 Algorithms
- BCBiconnected Components
1 Algorithms
- TCOTransitive Closure of a symmetric Boolean matrix
1 Algorithms