Uses of Interface
com.jgalgo.alg.shortestpath.ShortestPathSingleSource.Result
Package
Description
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 ShortestPathSingleSource.Result in com.jgalgo.alg.shortestpath
Modifier and TypeInterfaceDescriptionstatic interface
A result object for theShortestPathSingleSource
problem forIntGraph
.Modifier and TypeMethodDescription<V,
E> ShortestPathSingleSource.Result <V, E> ShortestPathSingleSource.computeShortestPaths
(Graph<V, E> g, WeightFunction<E> w, V source) Compute the shortest paths from a source to any other vertex in a graph.<V,
E> ShortestPathSingleSource.Result <V, E> ShortestPathSingleSourceAbstract.computeShortestPaths
(Graph<V, E> g, WeightFunction<E> w, V source)