Package org.jgrapht.alg.shortestpath
Shortest-path related algorithms.
-
Interface Summary Interface Description PathValidator<V,E> May be used to provide external path validations in addition to the basic validations done byKShortestPaths
- that the path is from source to target and that it does not contain loops. -
Class Summary Class Description AbstractPathElement<V,E> A new path is created from a path concatenated to an edge.AbstractPathElementList<V,E,T extends AbstractPathElement<V,E>> List of pathsAbstractPathElement
with same target vertex.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.BaseShortestPathAlgorithm<V,E> A base implementation of the shortest path interface.BellmanFordIterator<V,E> Helper class forBellmanFordShortestPath
; not intended for general use.BellmanFordPathElement<V,E> Helper class forBellmanFordShortestPath
; not intended for general use.BellmanFordShortestPath<V,E> BidirectionalDijkstraShortestPath<V,E> A bidirectional version of Dijkstra's algorithm.DijkstraClosestFirstIterator<V,E> A light-weight version of the closest-first iterator for a directed or undirected graphs.DijkstraShortestPath<V,E> An implementation of Dijkstra's shortest path algorithm using a Fibonacci heap.FloydWarshallShortestPaths<V,E> The Floyd-Warshall algorithm.KShortestPaths<V,E> The algorithm determines the k shortest simple paths in increasing order of weight.KShortestPathsIterator<V,E> Helper class forKShortestPaths
.ListSingleSourcePathsImpl<V,E> An implementation ofShortestPathAlgorithm.SingleSourcePaths
which stores one path per vertex.RankingPathElement<V,E> Helper class forKShortestPaths
.RankingPathElementList<V,E> List of simple paths in increasing order of weight.RankingPathElementList.PathMask<V,E> TreeSingleSourcePathsImpl<V,E> An implementation ofShortestPathAlgorithm.SingleSourcePaths
which uses linear space.