Class CHManyToManyShortestPaths.CHManyToManyShortestPathsImpl

java.lang.Object
org.jgrapht.alg.interfaces.ManyToManyShortestPathsAlgorithm.BaseManyToManyShortestPathsImpl<V,E>
org.jgrapht.alg.shortestpath.CHManyToManyShortestPaths.CHManyToManyShortestPathsImpl
All Implemented Interfaces:
ManyToManyShortestPathsAlgorithm.ManyToManyShortestPaths<V,E>
Enclosing class:
CHManyToManyShortestPaths<V,E>

private class CHManyToManyShortestPaths.CHManyToManyShortestPathsImpl extends ManyToManyShortestPathsAlgorithm.BaseManyToManyShortestPathsImpl<V,E>
Implementation of ManyToManyShortestPathsAlgorithm.ManyToManyShortestPaths for many-to-many shortest paths algorithm based on contraction hierarchy. Paths are stored in form of bidirectional single source shortest paths trees. When a path weight is queried a value that is stored in distanceAndMiddleVertexMap is returned. When an actual paths is required it is constructed by recursively unpacking edges stored in the shortest paths trees corresponding to source and target vertices.