A reservoir at vertex 1 in the diagram below is to supply water to several pumping stations. The edge weights are costs of laying pipe from one station to another. How should the pipe be laid so that all stations are served, but cost is minimized? Use

(a) the policy improvement algorithm and

(b) Dijkstra's algorithm (see Exercise 14).

Transcribed Image Text:

1 3