Uses of Class
org.chocosolver.util.objects.graphs.DirectedGraph
-
Packages that use DirectedGraph Package Description org.chocosolver.solver.constraints.nary.circuit org.chocosolver.util.graphOperations.connectivity org.chocosolver.util.graphOperations.dominance -
-
Uses of DirectedGraph in org.chocosolver.solver.constraints.nary.circuit
Fields in org.chocosolver.solver.constraints.nary.circuit declared as DirectedGraph Modifier and Type Field Description protected DirectedGraph
PropCircuit_ArboFiltering. connectedGraph
-
Uses of DirectedGraph in org.chocosolver.util.graphOperations.connectivity
Constructors in org.chocosolver.util.graphOperations.connectivity with parameters of type DirectedGraph Constructor Description StrongConnectivityFinder(DirectedGraph graph)
-
Uses of DirectedGraph in org.chocosolver.util.graphOperations.dominance
Fields in org.chocosolver.util.graphOperations.dominance declared as DirectedGraph Modifier and Type Field Description protected DirectedGraph
AbstractLengauerTarjanDominatorsFinder. g
protected DirectedGraph
AbstractLengauerTarjanDominatorsFinder. T
Methods in org.chocosolver.util.graphOperations.dominance that return DirectedGraph Modifier and Type Method Description DirectedGraph
AbstractLengauerTarjanDominatorsFinder. getDominatorTree()
Get the dominator tree formed with arcs (x,y) such that x is the immediate dominator of yConstructors in org.chocosolver.util.graphOperations.dominance with parameters of type DirectedGraph Constructor Description AbstractLengauerTarjanDominatorsFinder(int s, DirectedGraph g)
Object that finds dominators of the given flow graph g(s)AlphaDominatorsFinder(int s, DirectedGraph g)
Object that finds dominators of the given flow graph g(s) It uses the LT algorithm which runs in O(alpha.m)SimpleDominatorsFinder(int s, DirectedGraph g)
Object that finds dominators of the given flow graph g(s) It uses the simple LT algorithm which runs in O(m.log(n))
-