# Strongly Connected Components

## 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

## Step Chart

## Improvement Table

Complexity Classes | Algorithm Paper Links | Lower Bounds Paper Links |
---|---|---|

Exp/Factorial | ||

Polynomial > 3 | ||

Cubic | ||

Quadratic | ||

nlogn | ||

Linear | ||

logn |