|
Class Summary |
| AbstractSCCImpl |
A convenience class for implementing SCC algorithms. |
| NodeNumberingAsPartitionVisitor |
Use a node numbering to store the partition numbers. |
| PartitionsTraversalVisitor |
This class wraps a NodePartitionsVisitor inside a traversal visitor. |
| SCCByDFSImpl |
Find strongly connected components by DFS (Tarjan's algorithm for SCCs). |
| SCCByDoubleDFSImpl |
This class implements the search for strongly connected components
using two DFS traversals, one in the original and one in the transposed graph. |
