Uses of Interface
org.jgrapht.graph.DirectedAcyclicGraph.VisitedStrategy
-
Packages that use DirectedAcyclicGraph.VisitedStrategy Package Description org.jgrapht.graph Implementations of various graphs. -
-
Uses of DirectedAcyclicGraph.VisitedStrategy in org.jgrapht.graph
Classes in org.jgrapht.graph that implement DirectedAcyclicGraph.VisitedStrategy Modifier and Type Class Description protected static class
DirectedAcyclicGraph.VisitedArrayImpl
A visited strategy using an array.protected static class
DirectedAcyclicGraph.VisitedArrayListImpl
A visited strategy using anArrayList
.protected static class
DirectedAcyclicGraph.VisitedBitSetImpl
A visited strategy which uses aBitSet
.protected static class
DirectedAcyclicGraph.VisitedHashSetImpl
A visited strategy using aHashSet
.Methods in org.jgrapht.graph that return DirectedAcyclicGraph.VisitedStrategy Modifier and Type Method Description DirectedAcyclicGraph.VisitedStrategy
DirectedAcyclicGraph.VisitedArrayImpl. getVisitedStrategy(DirectedAcyclicGraph.Region affectedRegion)
DirectedAcyclicGraph.VisitedStrategy
DirectedAcyclicGraph.VisitedArrayListImpl. getVisitedStrategy(DirectedAcyclicGraph.Region affectedRegion)
DirectedAcyclicGraph.VisitedStrategy
DirectedAcyclicGraph.VisitedBitSetImpl. getVisitedStrategy(DirectedAcyclicGraph.Region affectedRegion)
DirectedAcyclicGraph.VisitedStrategy
DirectedAcyclicGraph.VisitedHashSetImpl. getVisitedStrategy(DirectedAcyclicGraph.Region affectedRegion)
DirectedAcyclicGraph.VisitedStrategy
DirectedAcyclicGraph.VisitedStrategyFactory. getVisitedStrategy(DirectedAcyclicGraph.Region affectedRegion)
Create a new instance ofDirectedAcyclicGraph.VisitedStrategy
.Methods in org.jgrapht.graph with parameters of type DirectedAcyclicGraph.VisitedStrategy Modifier and Type Method Description private void
DirectedAcyclicGraph. dfsB(V initialVertex, java.util.Set<V> db, DirectedAcyclicGraph.VisitedStrategy visited, DirectedAcyclicGraph.Region affectedRegion)
Depth first search backward, building up the set (db) of back-connected vertices in the Affected Regionprivate void
DirectedAcyclicGraph. dfsF(V initialVertex, java.util.Set<V> df, DirectedAcyclicGraph.VisitedStrategy visited, DirectedAcyclicGraph.Region affectedRegion)
Depth first search forward, building up the set (df) of forward-connected vertices in the Affected Regionprivate void
DirectedAcyclicGraph. reorder(java.util.Set<V> df, java.util.Set<V> db, DirectedAcyclicGraph.VisitedStrategy visited)
-