| Class | Description |
|---|---|
| StronglyConnectedComponentDetector<T> |
An object that splits a graph into strongly connected components lazily with
Tarjan's Strongly Connected Components Algorithm.
|
| TopologicalSort |
Provides a topological sort algorithm.
|
| Exception | Description |
|---|---|
| CyclePresentException |
An exception thrown for graphs with cycles as an argument for topological sort.
|