Uses of Enum
org.jgrapht.alg.cycle.ChordalityInspector.IterationOrder
Package
Description
Clique related algorithms.
Graph coloring algorithms.
Algorithms related to graph cycles.
Algorithms for Independent
Set in a graph.
-
Uses of ChordalityInspector.IterationOrder in org.jgrapht.alg.clique
ModifierConstructorDescriptionChordalGraphMaxCliqueFinder
(Graph<V, E> graph, ChordalityInspector.IterationOrder iterationOrder) Creates a new ChordalGraphMaxCliqueFinder instance. -
Uses of ChordalityInspector.IterationOrder in org.jgrapht.alg.color
ModifierConstructorDescriptionChordalGraphColoring
(Graph<V, E> graph, ChordalityInspector.IterationOrder iterationOrder) Creates a new ChordalGraphColoring instance. -
Uses of ChordalityInspector.IterationOrder in org.jgrapht.alg.cycle
Modifier and TypeMethodDescriptionChordalityInspector.getIterationOrder()
Returns the type of iterator used in thisChordalityInspector
Returns the enum constant of this type with the specified name.static ChordalityInspector.IterationOrder[]
ChordalityInspector.IterationOrder.values()
Returns an array containing the constants of this enum type, in the order they are declared.ModifierConstructorDescriptionChordalityInspector
(Graph<V, E> graph, ChordalityInspector.IterationOrder iterationOrder) Creates a chordality inspector forgraph
, which uses an iterator defined by the second parameter as an internal iterator. -
Uses of ChordalityInspector.IterationOrder in org.jgrapht.alg.independentset
ModifierConstructorDescriptionChordalGraphIndependentSetFinder
(Graph<V, E> graph, ChordalityInspector.IterationOrder iterationOrder) Creates a new ChordalGraphIndependentSetFinder instance.