Uses of Interface
org.jgrapht.experimental.dag.DirectedAcyclicGraph.Visited

Packages that use DirectedAcyclicGraph.Visited

Package	Description
org.jgrapht.experimental.dag	Experimental package with directed acyclic graphs.

Uses of DirectedAcyclicGraph.Visited in org.jgrapht.experimental.dag

Classes in org.jgrapht.experimental.dag that implement DirectedAcyclicGraph.Visited

Modifier and Type	Class	Description
static class	DirectedAcyclicGraph.VisitedArrayImpl	This implementation, somewhat to my surprise, is slower than the ArrayList version, probably due to its reallocation of the underlying array for every topology reorder that is required.
static class	DirectedAcyclicGraph.VisitedArrayListImpl	This implementation seems to offer the best performance in most cases.
static class	DirectedAcyclicGraph.VisitedBitSetImpl	This implementation is close to the performance of VisitedArrayListImpl, with 1/8 the memory usage.
static class	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).

Methods in org.jgrapht.experimental.dag that return DirectedAcyclicGraph.Visited

Modifier and Type	Method	Description
DirectedAcyclicGraph.Visited	DirectedAcyclicGraph.VisitedArrayImpl.getInstance(DirectedAcyclicGraph.Region affectedRegion)
DirectedAcyclicGraph.Visited	DirectedAcyclicGraph.VisitedArrayListImpl.getInstance(DirectedAcyclicGraph.Region affectedRegion)
DirectedAcyclicGraph.Visited	DirectedAcyclicGraph.VisitedBitSetImpl.getInstance(DirectedAcyclicGraph.Region affectedRegion)
DirectedAcyclicGraph.Visited	DirectedAcyclicGraph.VisitedFactory.getInstance(DirectedAcyclicGraph.Region affectedRegion)	Create a new instance of DirectedAcyclicGraph.Visited.
DirectedAcyclicGraph.Visited	DirectedAcyclicGraph.VisitedHashSetImpl.getInstance(DirectedAcyclicGraph.Region affectedRegion)

Methods in org.jgrapht.experimental.dag with parameters of type DirectedAcyclicGraph.Visited

Modifier and Type	Method	Description
private void	DirectedAcyclicGraph.dfsB(V vertex, java.util.Set<V> db, DirectedAcyclicGraph.Visited visited, DirectedAcyclicGraph.Region affectedRegion)	Depth first search backward, building up the set (db) of back-connected vertices in the Affected Region
private void	DirectedAcyclicGraph.dfsF(V vertex, java.util.Set<V> df, DirectedAcyclicGraph.Visited visited, DirectedAcyclicGraph.Region affectedRegion)	Depth first search forward, building up the set (df) of forward-connected vertices in the Affected Region
private void	DirectedAcyclicGraph.reorder(java.util.Set<V> df, java.util.Set<V> db, DirectedAcyclicGraph.Visited visited)