- <init>
Construct a directed acyclic graph.
- addEdge
The complexity of adding a new edge in the graph depends on the number of edges
incident to the "af
- addVertex
- assertVertexExist
- containsEdge
- dfsB
Depth first search backward, building up the set (db) of back-connected vertices
in the Affected Reg
- dfsF
Depth first search forward, building up the set (df) of forward-connected
vertices in the Affected R
- getEdgeSource
- incomingEdgesOf
- iterator
Returns a topological order iterator.
- outgoingEdgesOf
- reorder