Uses of Interface
org.goplanit.algorithms.shortest.MinMaxPathResult

Packages that use MinMaxPathResult

Package	Description
org.goplanit.algorithms.shortest	Shortest Path algorithms for PlanIt
org.goplanit.assignment.ltm.sltm
org.goplanit.assignment.ltm.sltm.conjugate

Uses of MinMaxPathResult in org.goplanit.algorithms.shortest

Classes in org.goplanit.algorithms.shortest that implement MinMaxPathResult

Modifier and Type	Class	Description
class	MinMaxPathResultImpl	Implementation of the MinMaxPathResult interface

Methods in org.goplanit.algorithms.shortest that return MinMaxPathResult

Modifier and Type	Method	Description
MinMaxPathResult	ShortestPathAcyclicMinMaxGeneralised.executeAllToOne(DirectedVertex currentDestination)	Construct shortest paths from all nodes to a destination node in the network based on directed LinkSegment edges
MinMaxPathResult	ShortestPathAcyclicMinMaxGeneralised.executeOneToAll(DirectedVertex currentOrigin)	Construct shortest paths from source node to all other nodes in the network based on directed LinkSegment edges

Uses of MinMaxPathResult in org.goplanit.assignment.ltm.sltm

Methods in org.goplanit.assignment.ltm.sltm that return MinMaxPathResult

Modifier and Type	Method	Description
MinMaxPathResult	DestinationBush.computeMinMaxShortestPaths(double[] linkSegmentCosts, int totalTransportNetworkVertices)	Compute the min-max path tree rooted at the destination towards all origins given the provided (network wide) costs.
MinMaxPathResult	OriginBush.computeMinMaxShortestPaths(double[] linkSegmentCosts, int totalTransportNetworkVertices)	Compute the min-max path tree rooted at the origin and given the provided (network wide) costs.
abstract MinMaxPathResult	RootedBush.computeMinMaxShortestPaths(double[] linkSegmentCosts, int totalTransportNetworkVertices)	Compute the min-max path tree rooted in location depending on underlying dag configuration of derived implementation and given the provided (network wide) costs.
abstract MinMaxPathResult	RootedLabelledBush.computeMinMaxShortestPaths(double[] linkSegmentCosts, int totalTransportNetworkVertices)	Compute the min-max path tree rooted in location depending on underlying dag configuration of derived implementation and given the provided (network wide) costs.

Uses of MinMaxPathResult in org.goplanit.assignment.ltm.sltm.conjugate

Methods in org.goplanit.assignment.ltm.sltm.conjugate that return MinMaxPathResult

Modifier and Type	Method	Description
MinMaxPathResult	ConjugateDestinationBush.computeMinMaxShortestPaths(double[] conjugatelinkSegmentCosts, int totalConjugateVertices)	Compute the min-max path tree rooted in location depending on underlying dag configuration of derived implementation and given the provided conjugate (network wide) costs.