The cost of a route in the **(di)graph G **is the cost of the subgraph which is constructed by the
route itself.Among all the routes from V(i) to V(j) in a graph,there is at least one with minimum
cost.This route is called ** "minimum route" ,(m.r.)**.

The following algorithms are also examples of the greedy method or/and dynamic programming methods.

**Problem of minimum routes by a starting point ****:**A peak of the graph is given,and named as
starting point.For every other peak,a * m.r.* is wanted for the starting point to the peak.The cost of
this

Click

Click

HTML PAGE DIRECTOR :Papaioannou Panagiotis