# The net of roads in Fig. 488 connecting four villages is to be reduced to minimum length, but so that one can still reach every village from every other village. Which of the roads should be retained? Find the solution (a) By inspection (b) By Dijkstra’s algorithm.

Chapter 23, PROBLEM SET 23.3 #1

The net of roads in Fig. 488 connecting four villages is to be reduced to minimum length, but so that one can still reach every village from every other village. Which of the roads should be retained? Find the solution

(a) By inspection

(b) By Dijkstra’s algorithm.

## This problem has been solved!

Do you need an answer to a question different from the above? Ask your question!

**Related Book For**

PROBLEM SET 23.2:

PROBLEM SET 23.4:

PROBLEM SET 23.5:

PROBLEM SET 23.6:

PROBLEM SET 23.7:

PROBLEM SET 23.8: