Uses of Class
org.jgrapht.experimental.dag.DirectedAcyclicGraph.CycleFoundException
-
Packages that use DirectedAcyclicGraph.CycleFoundException Package Description org.jgrapht.experimental.dag Experimental package with directed acyclic graphs. -
-
Uses of DirectedAcyclicGraph.CycleFoundException in org.jgrapht.experimental.dag
Methods in org.jgrapht.experimental.dag that throw DirectedAcyclicGraph.CycleFoundException Modifier and Type Method Description E
DirectedAcyclicGraph. addDagEdge(V fromVertex, V toVertex)
Adds the given edge and updates the internal topological order for consistency IFF there is not already an edge (fromVertex, toVertex) in the graph the edge does not induce a cycle in the graphboolean
DirectedAcyclicGraph. addDagEdge(V fromVertex, V toVertex, E e)
Adds the given edge and updates the internal topological order for consistency IFF the given edge is not already a member of the graph there is not already an edge (fromVertex, toVertex) in the graph the edge does not induce a cycle in the graphprivate 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 Regionprivate void
DirectedAcyclicGraph. updateDag(V fromVertex, V toVertex)
-