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

Packages that use MinMaxPathResult

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

Uses of MinMaxPathResult in org.goplanit.algorithms.shortestpath

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

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

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

Modifier and Type	Method	Description
MinMaxPathResult	AcyclicMinMaxShortestPathAlgorithm.executeOneToAll(DirectedVertex currentOrigin)	Perform a one-to-all min-max path search where we construct both the least and most costliest path from the origin vertex provided to all other vertices in the (sub)graph.

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	Bush.computeMinMaxShortestPaths(double[] linkSegmentCosts, int totalTransportNetworkVertices)	Compute the min-max path tree rooted at the origin and given the provided (network wide) costs.