| Interface | Description |
|---|---|
| PathValidator<V,E> |
May be used to provide external path validations in addition to the basic validations done by
KShortestPaths - 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.
|
| BellmanFordShortestPath<V,E> |
The Bellman-Ford algorithm.
|
| BidirectionalDijkstraShortestPath<V,E> |
A bidirectional version of Dijkstra's algorithm.
|
| DijkstraShortestPath<V,E> |
An implementation of Dijkstra's
shortest path algorithm using a Fibonacci heap.
|
| 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.
|
| KShortestPaths<V,E> |
The algorithm determines the k shortest simple paths in increasing order of weight.
|
| ListSingleSourcePathsImpl<V,E> |
An implementation of
ShortestPathAlgorithm.SingleSourcePaths which stores one path per vertex. |
| TreeSingleSourcePathsImpl<V,E> |
An implementation of
ShortestPathAlgorithm.SingleSourcePaths which uses linear space. |
Copyright © 2017. All rights reserved.