| Prev Package | Next Package | Frames | No Frames |
Class Summary | |
| ConnectivityInspector | Allows obtaining various connectivity aspects of a graph. |
| CycleDetector | Performs cycle detection on a graph. |
| DijkstraShortestPath | An implementation of Dijkstra's
shortest path algorithm using ClosestFirstIterator. |
| StrongConnectivityInspector |
Complements the ConnectivityInspector class
with the capability to compute the strongly connected components of a
directed graph. |
| VertexCovers | Algorithms to find a vertex cover for a graph. |