Uses of Enum
com.jgalgo.alg.common.EdgeDirection
Package
Description
Package for common classes and interfaces used by the algorithms in the JGAlgo library.
Algorithms for computing the cores of graphs.
Algorithms for solving set cover problems, such as minimum vertex/edge cover, dominating set, etc.
-
Uses of EdgeDirection in com.jgalgo.alg.common
Modifier and TypeMethodDescriptionstatic EdgeDirection
Returns the enum constant of this type with the specified name.static EdgeDirection[]
EdgeDirection.values()
Returns an array containing the constants of this enum type, in the order they are declared. -
Uses of EdgeDirection in com.jgalgo.alg.cores
Modifier and TypeMethodDescription<V,
E> CoresAlgo.Result <V, E> CoresAlgo.computeCores
(Graph<V, E> g, EdgeDirection degreeType) Compute the cores of the graph with respect the given degree type.<V,
E> CoresAlgo.Result <V, E> CoresAlgoAbstract.computeCores
(Graph<V, E> g, EdgeDirection degreeType) -
Uses of EdgeDirection in com.jgalgo.alg.cover
Modifier and TypeMethodDescription<V,
E> Set <V> DominatingSetAlgo.computeMinimumDominationSet
(Graph<V, E> g, WeightFunction<V> w, EdgeDirection dominanceDirection) Compute a minimum dominating set of the graph with respect to the given edges direction.<V,
E> Set <V> DominatingSetAlgoAbstract.computeMinimumDominationSet
(Graph<V, E> g, WeightFunction<V> w, EdgeDirection dominanceDirection) static <V,
E> boolean DominatingSetAlgo.isDominatingSet
(Graph<V, E> g, Collection<V> dominatingSet, EdgeDirection dominanceDirection) Check whether a given set of vertices is a dominating set of a graph.