Strongly Connected Components
Jump to navigation Jump to search
The strongly connected components or diconnected components of an arbitrary
directed graph form a partition into subgraphs that are themselves strongly connected.
|Complexity Classes||Algorithm Paper Links||Lower Bounds Paper Links|
|Polynomial > 3|