| Interface | Description |
|---|---|
| PathValidator<V,E> |
May be used to provide external path validations in addition to the basic validations done by
KShortestSimplePaths - that the path is from source to target and that it does not
contain loops. |
| Class | Description |
|---|---|
| AllDirectedPaths<V,E> |
A Dijkstra-like algorithm to find all paths between two sets of nodes in a directed graph, with
options to search only simple paths and to limit the path length.
|
| ALTAdmissibleHeuristic<V,E> |
An admissible heuristic for the A* algorithm using a set of landmarks and the triangle
inequality.
|
| AStarShortestPath<V,E> |
A* shortest path.
|
| BaseBidirectionalShortestPathAlgorithm<V,E> |
Base class for the bidirectional shortest path algorithms.
|
| BellmanFordShortestPath<V,E> |
The Bellman-Ford algorithm.
|
| BFSShortestPath<V,E> |
The BFS Shortest Path algorithm.
|
| BhandariKDisjointShortestPaths<V,E> |
An implementation of Bhandari algorithm for finding $K$ edge-disjoint shortest paths.
|
| BidirectionalAStarShortestPath<V,E> |
A bidirectional version of A* algorithm.
|
| BidirectionalDijkstraShortestPath<V,E> |
A bidirectional version of Dijkstra's algorithm.
|
| DeltaSteppingShortestPath<V,E> |
Parallel implementation of a single-source shortest path algorithm: the delta-stepping algorithm.
|
| DijkstraShortestPath<V,E> |
An implementation of Dijkstra's
shortest path algorithm using a pairing heap by default.
|
| EppsteinKShortestPath<V,E> |
Implementation of the Eppstein`s algorithm for finding $k$ shortest path between two vertices in
a graph.
|
| EppsteinShortestPathIterator<V,E> |
Iterator over the shortest paths (not required to be simple) between two vertices in a graph
sorted by weight.
|
| FloydWarshallShortestPaths<V,E> |
The Floyd-Warshall algorithm.
|
| GraphMeasurer<V,E> |
Algorithm class which computes a number of distance related metrics.
|
| JohnsonShortestPaths<V,E> |
Johnson's all pairs shortest paths algorithm.
|
| KShortestSimplePaths<V,E> |
The algorithm determines the k shortest simple paths in increasing order of weight.
|
| ListMultiObjectiveSingleSourcePathsImpl<V,E> |
An implementation of
MultiObjectiveShortestPathAlgorithm.MultiObjectiveSingleSourcePaths which stores one list of paths per
vertex. |
| ListSingleSourcePathsImpl<V,E> |
An implementation of
ShortestPathAlgorithm.SingleSourcePaths which stores one path per vertex. |
| MartinShortestPath<V,E> |
Martin's algorithm for the multi-objective shortest paths problem.
|
| SuurballeKDisjointShortestPaths<V,E> |
An implementation of Suurballe algorithm for finding K edge-disjoint shortest paths.
|
| TreeMeasurer<V,E> |
Algorithm class which computes a number of distance related metrics for trees.
|
| TreeSingleSourcePathsImpl<V,E> |
An implementation of
ShortestPathAlgorithm.SingleSourcePaths which uses linear space. |
| YenKShortestPath<V,E> |
Implementation of Yen`s algorithm for finding $k$ shortest loopless paths.
|
| YenShortestPathIterator<V,E> |
Iterator over the shortest loopless paths between two vertices in a graph sorted by weight.
|
| Exception | Description |
|---|---|
| NegativeCycleDetectedException |
An exception used to notify about the detection of a negative cycle.
|
Copyright © 2019. All rights reserved.