4.1.16.2.3 MinWeightPath

 procedure MinWeightPath(
   vSet: set of DSName,
   aSet: WeightedArcSet): WeightedArcSet

Returns a WeightedArcSet where, for each WeightedArc a:

  • a.initial and a.final are vertices in vSet

  • a.final is reachable from a.initial in the graph G = (vSet, aSet)

  • a.cost is the cost of the minimum-cost path in G from a.initial to a.final.