Package org.goplanit.algorithms.shortestpath

Shortest Path algorithms for PlanIt

Interface Summary

Interface	Description
MinMaxPathResult	Track results of a min-max path tree path execution allowing one to extract both minimum and maximum cost paths along the tree.
OneToAllShortestPathAlgorithm	An algorithm which calculates the shortest (a.k.a.
OneToOneShortestPathAlgorithm	An algorithm which calculates the shortest (a.k.a.
ShortestPathResult	Interfaces that defines how to access results of a shortest path execution allowing one to extract paths or cost information

Class Summary

Class	Description
AcyclicMinMaxShortestPathAlgorithm	Build a min/max shortest path tree for a given origin vertex.
AStarShortestPathAlgorithm	A* shortest path algorithm A* shortest path is a one-to-one implementation of the shortest path algorithm based on the generalized costs on each link segment (edge).
DijkstraShortestPathAlgorithm	Dijkstra's shortest path algorithm Dijkstra's shortest path is a one-to-all implementation of the shortest path algorithm based on the generalized costs on each link segment (edge).
MinMaxPathResultImpl	Implementation of the MinMaxPathResult interface
ShortestPathResultImpl	Class that stores the result of a shortest path execution allowing one to extract paths or cost information Note that we must traverse a path from an origin to a destination in reversed order to extract the path