The data associated with the vertex.
The vertex whose predecessors are to be found.
All immediate predecessors of the given vertex. None if the vertex does not exist.
The vertex whose successors are to be found.
All immediate successors of the given vertex. None if the vertex does not exist.
Generated using TypeDoc
Adapter for a graph data structure. These are the only methods the algorithm CycleDetector needs. See GenericGraphAdapter and GraphlibAdapter for two sample implementations.