Package org.planit.algorithms.shortestpath

Shortest Path algorithms for PlanIt

Interface Summary

Interface	Description
ShortestPathAlgorithm	An algorithm which calculates the shortest (a.k.a.

Class Summary

Class	Description
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).