Uses of Interface
com.jgalgo.graph.WeightFunction

Packages that use WeightFunction

Package	Description
com.jgalgo
com.jgalgo.graph

Uses of WeightFunction in com.jgalgo

Methods in com.jgalgo with parameters of type WeightFunction

Modifier and Type	Method	Description
ShortestPathAllPairs.Result	ShortestPathAllPairs.computeAllShortestPaths(Graph g, WeightFunction w)	Compute the shortest path between each pair of vertices in a graph.
TreePathMaxima.Result	TreePathMaxima.computeHeaviestEdgeInTreePaths(Graph tree, WeightFunction w, TreePathMaxima.Queries queries)	Compute the heaviest edge in multiple tree paths.
Matching	MatchingAlgorithm.computeMaximumWeightedMatching(Graph g, WeightFunction w)	Compute the maximum weighted matching of a weighted undirected graph.
Matching	MatchingAlgorithm.computeMaximumWeightedPerfectMatching(Graph g, WeightFunction w)	Compute the maximum perfect matching of a weighted undirected graph.
void	MinimumCostFlow.computeMinCostFlow(Graph g, FlowNetwork net, WeightFunction cost, WeightFunction supply)	Compute the min-cost (not maximum!) flow in a network given a supply for each vertex.
void	MinimumCostFlow.computeMinCostFlow(Graph g, FlowNetwork net, WeightFunction cost, WeightFunction lowerBound, WeightFunction supply)	Compute the min-cost (not maximum!) flow in a network given a supply for each vertex and a lower bound for the edges flows.
void	MinimumCostFlow.computeMinCostMaxFlow(Graph g, FlowNetwork net, WeightFunction cost, int source, int sink)	Compute the min-cost max-flow in a network between a source and a sink.
void	MinimumCostFlow.computeMinCostMaxFlow(Graph g, FlowNetwork net, WeightFunction cost, WeightFunction lowerBound, int source, int sink)	Compute the min-cost max-flow in a network between a source and a sink given a lower bound for the edges flows.
void	MinimumCostFlow.computeMinCostMaxFlow(Graph g, FlowNetwork net, WeightFunction cost, WeightFunction lowerBound, IntCollection sources, IntCollection sinks)	Compute the min-cost max-flow in a network between a set of sources and a set of sinks given a lower bound for the edges flows.
void	MinimumCostFlow.computeMinCostMaxFlow(Graph g, FlowNetwork net, WeightFunction cost, IntCollection sources, IntCollection sinks)	Compute the min-cost max-flow in a network between a set of sources and a set of sinks.
Cut	MinimumCutGlobal.computeMinimumCut(Graph g, WeightFunction w)	Compute the global minimum cut in a graph.
Cut	MinimumCutST.computeMinimumCut(Graph g, WeightFunction w, int source, int sink)	Compute the minimum cut in a graph between two terminal vertices.
Cut	MinimumCutST.computeMinimumCut(Graph g, WeightFunction w, IntCollection sources, IntCollection sinks)	Compute the minimum cut in a graph between two sets of vertices.
MinimumSpanningTree.Result	MinimumDirectedSpanningTree.computeMinimumDirectedSpanningTree(Graph g, WeightFunction w, int root)	Compute a minimum directed spanning tree (MDST) in a directed graph, rooted at the given vertex.
Path	MinimumMeanCycle.computeMinimumMeanCycle(Graph g, WeightFunction w)	Compute the minimum mean cycle in a graph.
MinimumSpanningTree.Result	MinimumSpanningTree.computeMinimumSpanningTree(Graph g, WeightFunction w)	Compute the minimum spanning tree (MST) of a given graph.
VertexCover.Result	VertexCover.computeMinimumVertexCover(Graph g, WeightFunction w)	Compute a minimum vertex cover of a graph with respect to a vertex weight function.
Matching	MatchingAlgorithm.computeMinimumWeightedMatching(Graph g, WeightFunction w)	Compute the minimum weighted matching of a weighted undirected graph.
Matching	MatchingAlgorithm.computeMinimumWeightedPerfectMatching(Graph g, WeightFunction w)	Compute the minimum perfect matching of a weighted undirected graph.
Path	ChinesePostman.computeShortestEdgeVisitorCircle(Graph g, WeightFunction w)	Compute the shortest circuit that visits all edges in the graph at least once.
Path	ShortestPathWithHeuristic.computeShortestPath(Graph g, WeightFunction w, int source, int target, IntToDoubleFunction vHeuristic)	Compute the shortest path between two vertices in a graph.
ShortestPathSingleSource.Result	ShortestPathSingleSource.computeShortestPaths(Graph g, WeightFunction w, int source)	Compute the shortest paths from a source to any other vertex in a graph.
Path	TSPMetric.computeShortestTour(Graph g, WeightFunction w)	Compute the shortest tour that visit all vertices.
ShortestPathAllPairs.Result	ShortestPathAllPairs.computeSubsetShortestPaths(Graph g, IntCollection verticesSubset, WeightFunction w)	Compute the shortest path between each pair of vertices in a given subset of the vertices of the graph.
default double	FlowNetwork.getCostSum(IntCollection edges, WeightFunction cost)	Get the cost of the flow along a set of edges.
default double	FlowNetwork.Int.getCostSum(IntCollection edges, WeightFunction cost)
static boolean	TreePathMaxima.verifyMST(Graph g, WeightFunction w, IntCollection mstEdges, TreePathMaxima tpmAlgo)	Verify that the given edges actually form an MST of a graph.
double	Cut.weight(WeightFunction w)	Get the weight of the cut with respect to the given weight function.
double	Matching.weight(WeightFunction w)	Get the weight of the matching with respect to some weight function.
double	MinimumSpanningTree.Result.weight(WeightFunction w)	Get the MST weight with respect to a weight function
default double	Path.weight(WeightFunction w)	Get the weight of the path with respect to some weight function.
double	VertexCover.Result.weight(WeightFunction w)	Get the weight of the cover with respect to a vertex weight function.

Uses of WeightFunction in com.jgalgo.graph

Subinterfaces of WeightFunction in com.jgalgo.graph

Modifier and Type	Interface	Description
static interface	WeightFunction.Int	Weight function that maps graph edges (or vertices) to integer weights.
static interface	Weights.Byte	Specific weights of primitive type byte.
static interface	Weights.Double	Specific weights of primitive type double.
static interface	Weights.Float	Specific weights of primitive type float.
static interface	Weights.Int	Specific weights of primitive type int.
static interface	Weights.Long	Specific weights of primitive type long.
static interface	Weights.Short	Specific weights of primitive type short.

Methods in com.jgalgo.graph that return WeightFunction

Modifier and Type	Method	Description
static WeightFunction	IndexIdMaps.idToIndexWeightFunc(WeightFunction w, IndexIdMap map)	Create a weight function that accept elements indices, given a weight function that accept elements IDs.
static WeightFunction	WeightFunctions.localEdgeWeightFunction(IndexGraph g, WeightFunction w)	Get a 'local' version of a given weight function.

Methods in com.jgalgo.graph with parameters of type WeightFunction

Modifier and Type	Method	Description
static WeightFunction	IndexIdMaps.idToIndexWeightFunc(WeightFunction w, IndexIdMap map)	Create a weight function that accept elements indices, given a weight function that accept elements IDs.
static WeightFunction	WeightFunctions.localEdgeWeightFunction(IndexGraph g, WeightFunction w)	Get a 'local' version of a given weight function.