Uses of Interface
com.jgalgo.alg.shortestpath.VoronoiAlgo.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 VoronoiAlgo.Result in com.jgalgo.alg.shortestpath
Modifier and TypeInterfaceDescriptionstatic interface
A result object ofVoronoiAlgo
computation forIntGraph
.Modifier and TypeMethodDescription<V,
E> VoronoiAlgo.Result <V, E> VoronoiAlgo.computeVoronoiCells
(Graph<V, E> g, Collection<V> sites, WeightFunction<E> w) Compute the Voronoi cells of a graph with respect to a set of sites and an edge weight function.<V,
E> VoronoiAlgo.Result <V, E> VoronoiAlgoAbstract.computeVoronoiCells
(Graph<V, E> g, Collection<V> sites, WeightFunction<E> w)