Uses of Interface
com.jgalgo.graph.IWeightFunction
Package
Description
Algorithms for solving flow problems in graphs, such as maximum flow, min cost flow, and circulation problems.
Algorithms for finding paths in graphs, such as shortest paths, iterating over all simple paths between two vertices,
computing the Voronoi cells given a set of sites, ect.
Algorithms for finding the minimum spanning trees and Steiner trees of graphs.
Graphs object are the fundamental building blocks of the JGAlgo library.
-
Uses of IWeightFunction in com.jgalgo.alg.flow
Modifier and TypeMethodDescriptionMaximumFlowPushRelabel.computeMinimumCut
(IndexGraph g, IWeightFunction w, int source, int sink) -
Uses of IWeightFunction in com.jgalgo.alg.shortestpath
Modifier and TypeMethodDescriptionShortestPathHeuristicSt.computeShortestPath
(IntGraph g, IWeightFunction w, int source, int target, IntToDoubleFunction vHeuristic) Compute the shortest path between two vertices in an int graph.ShortestPathHeuristicStAbstract.computeShortestPath
(IntGraph g, IWeightFunction w, int source, int target, IntToDoubleFunction vHeuristic) -
Uses of IWeightFunction in com.jgalgo.alg.span
Modifier and TypeMethodDescriptionSteinerTreeMehlhorn.computeSteinerTree
(IndexGraph g, IWeightFunction w, IntCollection terminals) -
Uses of IWeightFunction in com.jgalgo.graph
Modifier and TypeInterfaceDescriptioninterface
Weight function that maps graph edges or vertices ofIntGraph
to integer weights.interface
Specific weights ofbyte
for int graphs.interface
Specific weights ofdouble
for int graphs.interface
Specific weights offloat
for int graphs.interface
Specific weights ofint
for int graphs.interface
Specific weights oflong
for int graphs.interface
Specific weights ofshort
for int graphs.Modifier and TypeMethodDescriptionstatic IWeightFunction
WeightFunctions.asIntGraphWeightFunc
(WeightFunction<Integer> w) Treat a given weight function as a weight function on a graph with integer vertices.static <K> IWeightFunction
IndexIdMaps.idToIndexWeightFunc
(WeightFunction<K> w, IndexIdMap<K> map) Create a weight function that accept elements indices, given a weight function that accept elements IDs.static IWeightFunction
WeightFunctions.localEdgeWeightFunction
(IndexGraph g, IWeightFunction w) Get a 'local' version of a given weight function.static IWeightFunction
WeightFunctions.negate
(IWeightFunction w) Get a weight function that returns the negative of the given weight function.static IWeightFunction
IWeightFunction.replaceNullWeightFunc
(IWeightFunction weightFunc) Replacenull
weight function withCardinalityWeightFunction
.Modifier and TypeMethodDescriptionstatic IWeightFunction
WeightFunctions.localEdgeWeightFunction
(IndexGraph g, IWeightFunction w) Get a 'local' version of a given weight function.static IWeightFunction
WeightFunctions.negate
(IWeightFunction w) Get a weight function that returns the negative of the given weight function.static IWeightFunction
IWeightFunction.replaceNullWeightFunc
(IWeightFunction weightFunc) Replacenull
weight function withCardinalityWeightFunction
.static double
IWeightFunction.weightSum
(IWeightFunction weightFunc, IntIterable elements) Get the sum of the weights of multiple elements.