| BaseBidirectionalShortestPathAlgorithm |
Base class for the bidirectional shortest path algorithms.
|
| BaseBidirectionalShortestPathAlgorithm.BaseSearchFrontier |
Base class of the search frontier used by bidirectional shortest path algorithms.
|
| BaseKDisjointShortestPathsAlgorithm |
A base implementation of a $k$ disjoint shortest paths algorithm based on the strategy used in
Suurballe and Bhandari algorithms.
|
| BaseManyToManyShortestPaths |
Base class for many-to-many shortest paths algorithms.
|
| BaseMultiObjectiveShortestPathAlgorithm |
A base implementation of the multi-objective shortest path interface.
|
| BaseShortestPathAlgorithm |
A base implementation of the shortest path interface.
|
| BidirectionalAStarShortestPath.AStarSearchFrontier |
Maintains search frontier during shortest path computation.
|
| BidirectionalAStarShortestPath.TerminationCriterion |
Termination criterion for the heuristic search.
|
| BidirectionalDijkstraShortestPath.DijkstraSearchFrontier |
Maintains search frontier during shortest path computation.
|
| CHManyToManyShortestPaths.BucketEntry |
Stores data computed during the backward searches.
|
| ContractionHierarchyBidirectionalDijkstra.ContractionSearchFrontier |
Maintains search frontier during shortest path computation.
|
| ContractionHierarchyPrecomputation.ContractionEdge |
Edge for building the contraction hierarchy.
|
| ContractionHierarchyPrecomputation.ContractionHierarchy |
Return type of this algorithm.
|
| ContractionHierarchyPrecomputation.ContractionTask |
Task that is used to perform computing of initial priorities, independent set and shortcuts,
updating neighbours priorities and marking upward edges.
|
| ContractionHierarchyPrecomputation.ContractionVertex |
Vertex for building the contraction hierarchy, which contains an original vertex from
graph.
|
| ContractionHierarchyPrecomputation.VertexData |
Contains information of a vertex needed during the contraction.
|
| ContractionHierarchyPrecomputation.VertexStatistics |
Contains statistics corresponding to a vertex in contractionGraph needed to compute
its priority.
|
| EppsteinShortestPathIterator.EppsteinGraphPath |
Represents a path that is generated during the computations.
|
| EppsteinShortestPathIterator.PathsGraphVertex |
Vertex of the paths graph.
|
| IntVertexDijkstraShortestPath.IdentifierMap |
A very special case linear probing hash table, fit for this particular use case.
|
| MartinShortestPath.Label |
A node label.
|
| PathValidator |
Path validator for shortest path algorithms.
|
| TransitNodeRoutingPrecomputation.AccessVertex |
Forward or backward access vertex computed for a certain vertex $v$ in the graph.
|
| TransitNodeRoutingPrecomputation.AccessVertices |
Stores forward and backward access vertices computed for the transit node routing.
|
| TransitNodeRoutingPrecomputation.AccessVerticesBuilder |
Provides API to build an AccessVertices object.
|
| TransitNodeRoutingPrecomputation.ContractionHierarchyBFS |
BFS algorithm which is used to compute access vertices and locality filter.
|
| TransitNodeRoutingPrecomputation.LocalityFilter |
Search space based locality filter.
|
| TransitNodeRoutingPrecomputation.LocalityFilterBuilder |
Provides API to build a LocalityFilter object.
|
| TransitNodeRoutingPrecomputation.TransitNodeRouting |
This class represents return type of this algorithm and contains all data computed during the
execution of the algorithm.
|
| TransitNodeRoutingPrecomputation.VoronoiDiagram |
Voronoi diagram for a graph.
|
| TreeSingleSourcePathsImpl |
|