The net of roads in Fig. 487 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.
Read moreTable of Contents
Textbook Solutions for Advanced Engineering Mathematics
Question
The net of roads in Fig. 487 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.
Solution
The first step in solving 23.3 problem number 1 trying to solve the problem we have to refer to the textbook question: The net of roads in Fig. 487 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.
From the textbook chapter Bellman's Principle. Dijkstra's Algorithm you will find a few key concepts needed to solve this.
Visible to paid subscribers only
Step 3 of 7)Visible to paid subscribers only
full solution