Strongly Connected Components

From Algorithm Wiki
Jump to navigation Jump to search

Problem Description

The strongly connected components or diconnected components of an arbitrary

directed graph form a partition into subgraphs that are themselves
strongly connected.

Bounds Chart

Strongly Connected ComponentsBoundsChart.png

Step Chart

[[File:Strongly_Connected ComponentsStepChart.png|350px]]

Improvement Table

Complexity Classes Algorithm Paper Links Lower Bounds Paper Links
Exp/Factorial
Polynomial > 3
Cubic
Quadratic
nlogn
Linear
logn