Uses of Interface
com.jgalgo.alg.ShortestPathAllPairs.Result

Packages that use ShortestPathAllPairs.Result

Package	Description
com.jgalgo.alg	Algorithms for solving graph problems.

Uses of ShortestPathAllPairs.Result in com.jgalgo.alg

Subinterfaces of ShortestPathAllPairs.Result in com.jgalgo.alg

Modifier and Type	Interface	Description
static interface	ShortestPathAllPairs.IResult	A result object for an ShortestPathAllPairs algorithm for IntGraph.

Methods in com.jgalgo.alg that return ShortestPathAllPairs.Result

Modifier and Type	Method	Description
<V,E> ShortestPathAllPairs.Result<V,E>	ShortestPathAllPairs.computeAllShortestPaths(Graph<V,E> g, WeightFunction<E> w)	Compute the shortest path between each pair of vertices in a graph.
<V,E> ShortestPathAllPairs.Result<V,E>	ShortestPathAllPairs.computeSubsetShortestPaths(Graph<V,E> g, Collection<V> verticesSubset, WeightFunction<E> w)	Compute the shortest path between each pair of vertices in a given subset of the vertices of the graph.