| Interface | Description |
|---|---|
| SCCListener<N> |
| Class | Description |
|---|---|
| SCCCollector<N> | |
| SCCs |
Algorithms for finding strongly-connected components (SCCs) in a graph.
|
| TarjanSCCVisitor<N,E> |
Depth-first traversal visitor realizing Tarjan's algorithm for finding all
strongly-connected components (SCCs) in a graph.
|
Copyright © 2013. All Rights Reserved.