Uses of Interface com.jgalgo.WeightFunction (JGAlgo - Core 0.1.1.2 API)

Uses of WeightFunction in com.jgalgo

Subinterfaces of WeightFunction in com.jgalgo
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 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`	MaximumMatching.`computeMaximumWeightedMatching(Graph g, WeightFunction w)`	Compute the maximum weighted matching of a weighted undirected graph.
`Matching`	MaximumMatching.`computeMaximumWeightedPerfectMatching(Graph g, WeightFunction w)`	Compute the maximum perfect matching of a weighted undirected graph.
`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 and a weight function with two terminal 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.
`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.
`static boolean`	TreePathMaxima.`verifyMST(Graph g, WeightFunction w, it.unimi.dsi.fastutil.ints.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.