Uses of Interface
org.jgrapht.alg.interfaces.ManyToManyShortestPathsAlgorithm.ManyToManyShortestPaths
Packages that use ManyToManyShortestPathsAlgorithm.ManyToManyShortestPaths
Package
Description
Algorithm related interfaces.
Shortest-path related algorithms.
-
Uses of ManyToManyShortestPathsAlgorithm.ManyToManyShortestPaths in org.jgrapht.alg.interfaces
Classes in org.jgrapht.alg.interfaces that implement ManyToManyShortestPathsAlgorithm.ManyToManyShortestPathsModifier and TypeClassDescriptionstatic class
Base class for many-to-many shortest paths implementations.Methods in org.jgrapht.alg.interfaces that return ManyToManyShortestPathsAlgorithm.ManyToManyShortestPathsModifier and TypeMethodDescriptionManyToManyShortestPathsAlgorithm.getManyToManyPaths
(Set<V> sources, Set<V> targets) Computes shortest paths from all vertices insources
to all vertices intargets
. -
Uses of ManyToManyShortestPathsAlgorithm.ManyToManyShortestPaths in org.jgrapht.alg.shortestpath
Classes in org.jgrapht.alg.shortestpath that implement ManyToManyShortestPathsAlgorithm.ManyToManyShortestPathsModifier and TypeClassDescriptionprivate class
Implementation ofManyToManyShortestPathsAlgorithm.ManyToManyShortestPaths
for many-to-many shortest paths algorithm based on contraction hierarchy.(package private) static class
Implementation of theManyToManyShortestPathsAlgorithm.ManyToManyShortestPaths
.private class
Implementation of theManyToManyShortestPathsAlgorithm.ManyToManyShortestPaths
.Fields in org.jgrapht.alg.shortestpath declared as ManyToManyShortestPathsAlgorithm.ManyToManyShortestPathsModifier and TypeFieldDescriptionTransitNodeRoutingShortestPath.manyToManyShortestPaths
Many-to-many shortest paths between transit vertices.TransitNodeRoutingPrecomputation.PathsUnpackingTask.shortestPaths
Many-to-many shortest paths to be unpacked.TransitNodeRoutingPrecomputation.TransitNodeRouting.transitVerticesPaths
Paths between every pair of transit vertices.TransitNodeRoutingPrecomputation.transitVerticesPaths
Many-to-many shortest paths between transit vertices.Methods in org.jgrapht.alg.shortestpath that return ManyToManyShortestPathsAlgorithm.ManyToManyShortestPathsModifier and TypeMethodDescriptionCHManyToManyShortestPaths.getManyToManyPaths
(Set<V> sources, Set<V> targets) Computes shortest paths from all vertices insources
to all vertices intargets
.DefaultManyToManyShortestPaths.getManyToManyPaths
(Set<V> sources, Set<V> targets) DijkstraManyToManyShortestPaths.getManyToManyPaths
(Set<V> sources, Set<V> targets) Computes shortest paths from all vertices insources
to all vertices intargets
.TransitNodeRoutingPrecomputation.TransitNodeRouting.getTransitVerticesPaths()
Returns paths between every pair oftransitVertices
.TransitNodeRoutingPrecomputation.unpackPaths
(ManyToManyShortestPathsAlgorithm.ManyToManyShortestPaths<V, E> shortestPaths) Unpacks in parallel contracted paths stored inshortestPaths
.Methods in org.jgrapht.alg.shortestpath with parameters of type ManyToManyShortestPathsAlgorithm.ManyToManyShortestPathsModifier and TypeMethodDescriptionTransitNodeRoutingPrecomputation.AccessVerticesBuilder.getPrunedAccessVertices
(V v, Set<V> vertices, ManyToManyShortestPathsAlgorithm.ManyToManyShortestPaths<V, E> manyToManyShortestPaths, boolean forwardAccessVertices) Selects redundant access vertices fromvertices
.TransitNodeRoutingPrecomputation.unpackPaths
(ManyToManyShortestPathsAlgorithm.ManyToManyShortestPaths<V, E> shortestPaths) Unpacks in parallel contracted paths stored inshortestPaths
.Constructors in org.jgrapht.alg.shortestpath with parameters of type ManyToManyShortestPathsAlgorithm.ManyToManyShortestPathsModifierConstructorDescriptionPathsUnpackingTask
(int taskId, List<V> transitVertices, Map<V, Map<V, GraphPath<V, E>>> pathsMap, ManyToManyShortestPathsAlgorithm.ManyToManyShortestPaths<V, E> shortestPaths) Constructs a new instance for the giventaskId
,transitVertices
,pathsMap
andshortestPaths
.TransitNodeRouting
(ContractionHierarchyPrecomputation.ContractionHierarchy<V, E> contractionHierarchy, Set<ContractionHierarchyPrecomputation.ContractionVertex<V>> transitVertices, ManyToManyShortestPathsAlgorithm.ManyToManyShortestPaths<V, E> transitVerticesPaths, TransitNodeRoutingPrecomputation.VoronoiDiagram<V> voronoiDiagram, TransitNodeRoutingPrecomputation.AccessVertices<V, E> accessVertices, TransitNodeRoutingPrecomputation.LocalityFilter<V> localityFilter) Constructs a new instance for the givencontractionHierarchy
,transitVertices
,transitVerticesPaths
,voronoiDiagram
,accessVertices
andlocalityFilter
.