3 Given a network with the following distances From Node To
3. Given a network with the following distances:
From
Node
To
Node
Distance
1
2
150
1
3
200
2
4
200
2
3
50
4
6
100
3
4
300
3
5
350
5
6
100
(b) What is the minimum distance from Node 1 to Node 6?
| From Node | To Node | Distance | 
| 1 | 2 | 150 | 
| 1 | 3 | 200 | 
| 2 | 4 | 200 | 
| 2 | 3 | 50 | 
| 4 | 6 | 100 | 
| 3 | 4 | 300 | 
| 3 | 5 | 350 | 
| 5 | 6 | 100 | 
Solution
the network diagram is as follows
b.
the distance is calculated for the different paths
1-2-4-6 = 150+200+100 =450
1-2-3-4-6 =150+50+300+100 =600
1-3-5-6 =200+350+100 =650
1-2-3-5-6 =150+50+350+100 =650
the minimum distance is 450


