Name | Description | Type | Package | Framework |
DirectedAcyclicGraph | DirectedAcyclicGraph implements a DAG that can be modified (vertices & edges added and removed), is guaranteed to remain acyclic, and provides fast | Class | org.jgrapht.experimental.dag | JGraph |
DirectedAcyclicGraph .CycleFoundException | Exception used in dfsF when a cycle is foundAuthor:gilespSee Also:Serialized Form | Class | org.jgrapht.experimental.dag.DirectedAcyclicGraph | JGraph |
DirectedAcyclicGraph .Region | Region is an *inclusive* range of indices. | Class | org.jgrapht.experimental.dag.DirectedAcyclicGraph | JGraph |
DirectedAcyclicGraph .TopoOrderMapping | For performance tuning, an interface for storing the topological orderingget the topological index of the given vertex. | Interface | org.jgrapht.experimental.dag.DirectedAcyclicGraph | JGraph |
DirectedAcyclicGraph .TopoOrderMappingFactory | DirectedAcyclicGraph. | Interface | org.jgrapht.experimental.dag.DirectedAcyclicGraph | JGraph |
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 | Interface | org.jgrapht.experimental.dag.DirectedAcyclicGraph | JGraph |
DirectedAcyclicGraph .VisitedArrayImpl | This implementation, somewhat to my surprise, is slower than the ArrayList version, probably due to its reallocation of the underlying | Class | org.jgrapht.experimental.dag.DirectedAcyclicGraph | JGraph |
DirectedAcyclicGraph .VisitedArrayListImpl | This implementation seems to offer the best performance in most cases. | Class | org.jgrapht.experimental.dag.DirectedAcyclicGraph | JGraph |
DirectedAcyclicGraph .VisitedBitSetImpl | This implementation is close to the performance of VisitedArrayListImpl, with 1/8 the memory usage. | Class | org.jgrapht.experimental.dag.DirectedAcyclicGraph | JGraph |
DirectedAcyclicGraph .VisitedFactory | DirectedAcyclicGraph. | Interface | org.jgrapht.experimental.dag.DirectedAcyclicGraph | JGraph |
DirectedAcyclicGraph .VisitedHashSetImpl | This implementation doesn't seem to perform as well, though I can imagine circumstances where it should shine (lots and lots of vertices). | Class | org.jgrapht.experimental.dag.DirectedAcyclicGraph | JGraph |