Uses of Interface
org.jgrapht.alg.interfaces.ManyToManyShortestPathsAlgorithm.ManyToManyShortestPaths

Packages that use ManyToManyShortestPathsAlgorithm.ManyToManyShortestPaths

Package	Description
org.jgrapht.alg.interfaces	Algorithm related interfaces.
org.jgrapht.alg.shortestpath	Shortest-path related algorithms.

Uses of ManyToManyShortestPathsAlgorithm.ManyToManyShortestPaths in org.jgrapht.alg.interfaces

Classes in org.jgrapht.alg.interfaces that implement ManyToManyShortestPathsAlgorithm.ManyToManyShortestPaths

Modifier and Type	Class	Description
static class	ManyToManyShortestPathsAlgorithm.BaseManyToManyShortestPathsImpl<V,E>	Base class for many-to-many shortest paths implementations.

Methods in org.jgrapht.alg.interfaces that return ManyToManyShortestPathsAlgorithm.ManyToManyShortestPaths

Modifier and Type	Method	Description
ManyToManyShortestPathsAlgorithm.ManyToManyShortestPaths<V,E>	ManyToManyShortestPathsAlgorithm.getManyToManyPaths(java.util.Set<V> sources, java.util.Set<V> targets)	Computes shortest paths from all vertices in sources to all vertices in targets.

Uses of ManyToManyShortestPathsAlgorithm.ManyToManyShortestPaths in org.jgrapht.alg.shortestpath

Classes in org.jgrapht.alg.shortestpath that implement ManyToManyShortestPathsAlgorithm.ManyToManyShortestPaths

Modifier and Type	Class	Description
private class	CHManyToManyShortestPaths.CHManyToManyShortestPathsImpl	Implementation of ManyToManyShortestPathsAlgorithm.ManyToManyShortestPaths for many-to-many shortest paths algorithm based on contraction hierarchy.
(package private) static class	DefaultManyToManyShortestPaths.DefaultManyToManyShortestPathsImpl<V,E>	Implementation of the ManyToManyShortestPathsAlgorithm.ManyToManyShortestPaths.
private class	DijkstraManyToManyShortestPaths.DijkstraManyToManyShortestPathsImpl	Implementation of the ManyToManyShortestPathsAlgorithm.ManyToManyShortestPaths.

Fields in org.jgrapht.alg.shortestpath declared as ManyToManyShortestPathsAlgorithm.ManyToManyShortestPaths

Modifier and Type	Field	Description
private ManyToManyShortestPathsAlgorithm.ManyToManyShortestPaths<V,E>	TransitNodeRoutingShortestPath.manyToManyShortestPaths	Many-to-many shortest paths between transit vertices.
private ManyToManyShortestPathsAlgorithm.ManyToManyShortestPaths<V,E>	TransitNodeRoutingPrecomputation.PathsUnpackingTask.shortestPaths	Many-to-many shortest paths to be unpacked.
private ManyToManyShortestPathsAlgorithm.ManyToManyShortestPaths<V,E>	TransitNodeRoutingPrecomputation.TransitNodeRouting.transitVerticesPaths	Paths between every pair of transit vertices.
private ManyToManyShortestPathsAlgorithm.ManyToManyShortestPaths<V,E>	TransitNodeRoutingPrecomputation.transitVerticesPaths	Many-to-many shortest paths between transit vertices.

Methods in org.jgrapht.alg.shortestpath that return ManyToManyShortestPathsAlgorithm.ManyToManyShortestPaths

Modifier and Type	Method	Description
ManyToManyShortestPathsAlgorithm.ManyToManyShortestPaths<V,E>	CHManyToManyShortestPaths.getManyToManyPaths(java.util.Set<V> sources, java.util.Set<V> targets)	Computes shortest paths from all vertices in sources to all vertices in targets.
ManyToManyShortestPathsAlgorithm.ManyToManyShortestPaths<V,E>	DefaultManyToManyShortestPaths.getManyToManyPaths(java.util.Set<V> sources, java.util.Set<V> targets)
ManyToManyShortestPathsAlgorithm.ManyToManyShortestPaths<V,E>	DijkstraManyToManyShortestPaths.getManyToManyPaths(java.util.Set<V> sources, java.util.Set<V> targets)	Computes shortest paths from all vertices in sources to all vertices in targets.
ManyToManyShortestPathsAlgorithm.ManyToManyShortestPaths<V,E>	TransitNodeRoutingPrecomputation.TransitNodeRouting.getTransitVerticesPaths()	Returns paths between every pair of transitVertices.
private ManyToManyShortestPathsAlgorithm.ManyToManyShortestPaths<V,E>	TransitNodeRoutingPrecomputation.unpackPaths(ManyToManyShortestPathsAlgorithm.ManyToManyShortestPaths<V,E> shortestPaths)	Unpacks in parallel contracted paths stored in shortestPaths.

Methods in org.jgrapht.alg.shortestpath with parameters of type ManyToManyShortestPathsAlgorithm.ManyToManyShortestPaths

Modifier and Type	Method	Description
private java.util.Set<V>	TransitNodeRoutingPrecomputation.AccessVerticesBuilder.getPrunedAccessVertices(V v, java.util.Set<V> vertices, ManyToManyShortestPathsAlgorithm.ManyToManyShortestPaths<V,E> manyToManyShortestPaths, boolean forwardAccessVertices)	Selects redundant access vertices from vertices.
private ManyToManyShortestPathsAlgorithm.ManyToManyShortestPaths<V,E>	TransitNodeRoutingPrecomputation.unpackPaths(ManyToManyShortestPathsAlgorithm.ManyToManyShortestPaths<V,E> shortestPaths)	Unpacks in parallel contracted paths stored in shortestPaths.

Constructors in org.jgrapht.alg.shortestpath with parameters of type ManyToManyShortestPathsAlgorithm.ManyToManyShortestPaths

Constructor	Description
PathsUnpackingTask(int taskId, java.util.List<V> transitVertices, java.util.Map<V,java.util.Map<V,GraphPath<V,E>>> pathsMap, ManyToManyShortestPathsAlgorithm.ManyToManyShortestPaths<V,E> shortestPaths)	Constructs a new instance for the given taskId, transitVertices, pathsMap and shortestPaths.
TransitNodeRouting(ContractionHierarchyPrecomputation.ContractionHierarchy<V,E> contractionHierarchy, java.util.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 given contractionHierarchy, transitVertices, transitVerticesPaths, voronoiDiagram, accessVertices and localityFilter.