DirectedAcyclicGraph |
DirectedAcyclicGraph implements a DAG that can be modified (vertices & edges added and
removed), is guaranteed to remain acyclic, and provides fast topological order iteration.
|
DirectedAcyclicGraph.CycleFoundException |
Exception used in dfsF when a cycle is found
|
DirectedAcyclicGraph.Region |
Region is an *inclusive* range of indices.
|
DirectedAcyclicGraph.TopoComparator |
Note, this is a lazy and incomplete implementation, with assumptions that inputs are in the
given topoIndexMap
|
DirectedAcyclicGraph.TopoOrderMapping |
For performance tuning, an interface for storing the topological ordering
|
DirectedAcyclicGraph.TopoOrderMappingFactory |
|
DirectedAcyclicGraph.Visited |
This interface allows specification of a strategy for marking vertices as visited (based on
their topological index, so the vertex type isn't part of the interface).
|
DirectedAcyclicGraph.VisitedFactory |
Interface for a factory that vends visited implementations
|