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

Packages that use ShortestPathAllPairs.Result

Package	Description
com.jgalgo.alg.shortestpath	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.

Uses of ShortestPathAllPairs.Result in com.jgalgo.alg.shortestpath

Subinterfaces of ShortestPathAllPairs.Result in com.jgalgo.alg.shortestpath

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

Methods in com.jgalgo.alg.shortestpath 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>	ShortestPathAllPairsAbstract.computeAllShortestPaths(Graph<V,E> g, WeightFunction<E> w)
<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.
<V, E> ShortestPathAllPairs.Result<V,E>	ShortestPathAllPairsAbstract.computeSubsetShortestPaths(Graph<V,E> g, Collection<V> verticesSubset, WeightFunction<E> w)