Experimental package with directed acyclic graphs.
|Class and Description|
DirectedAcyclicGraph implements a DAG that can be modified (vertices & edges added and removed), is guaranteed to remain acyclic, and provides fast topological order iteration.
Exception used in dfsF when a cycle is found
Region is an *inclusive* range of indices.
For performance tuning, an interface for storing the topological ordering
A factory for
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).
Interface for a factory that vends visited implementations
Copyright © 2016. All rights reserved.