Package org.goplanit.algorithms.shortest

Shortest Path algorithms for PlanIt

Interface Summary

Interface	Description
MinMaxPathResult	Implementation of the MinMaxPathResult interface
ShortestBushAllToOne	An algorithm which calculates the shortest (a.k.a.
ShortestBushOneToAll	An algorithm which calculates the shortest (a.k.a.
ShortestBushResult	Interfaces that defines how to access results of a shortest bush execution allowing one to extract bushes or cost information
ShortestPathAllToOne	An algorithm which calculates the shortest (a.k.a.
ShortestPathOneToAll	An algorithm which calculates the shortest (a.k.a.
ShortestPathOneToOne	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
ShortestResult	Base interface that defines how to access results of a shortest X execution allowing one to extract information

Class Summary

Class	Description
ConjugateShortestPathGeneralised	Conjugate version of shortest path algorithm.
MinMaxPathResultImpl	Implementation of the MinMaxPathResult interface
ShortestBushGeneralised	Shortest bush algorithm.
ShortestBushResultGeneralised	Class that stores the result of a shortest bush execution allowing one to extract bushes or cost information for a given origin-to-vertex Note that we construct the bush in reverse order from destination to the origin via all viable paths to construct the bush
ShortestPathAcyclicMinMaxGeneralised	Build a min/max shortest path tree for a given start vertex based on the configuration used.
ShortestPathAStar	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).
ShortestPathDijkstra	Dijkstra's shortest path algorithm Dijkstra's shortest path is a one-to-all (or all-to-one) implementation of the shortest path algorithm based on the generalized costs on each link segment (edge).
ShortestPathGeneralised	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).
ShortestPathResultGeneralised	Class that stores the result of a shortest path execution allowing one to extract paths or cost information.
ShortestPathSearchUtils	Some common utilities for various shortest path algorithms.
ShortestResultGeneralised	Base class for shortestXResult classes

Enum Summary

Enum	Description
ShortestSearchType	Types of shortest path searches