Graphs and Networks Engineers decided to pump water from a central tank in each block of houses in the residential infrastructure. The pump and the eight houses in Zone 1 are shown as vertices in the given network diagram. The number of edges joining the vertices give the shortest distances, in metres, between locations. B 40 C 70 50 70 90 40 A 80 80 Pump 120 E 70 90 40 50 80 F
Graphs and Networks Engineers decided to pump water from a central tank in each block of houses in the residential infrastructure. The pump and the eight houses in Zone 1 are shown as vertices in the given network diagram. The number of edges joining the vertices give the shortest distances, in metres, between locations. B 40 C 70 50 70 90 40 A 80 80 Pump 120 E 70 90 40 50 80 F
Related questions
Question
10. What is the shortest distance from each house to the pump before lay pipes using Dijkstra’s Algorithm
11. Redraw the diagram and draw the shortest path they could use to lay pipes.
12. Starting at the pipe, determine the minimum length of pipe needed.
Transcribed Image Text:Graphs and Networks
Engineers decided to pump water from a central tank in each block of houses in the
residential infrastructure. The pump and the eight houses in Zone 1 are shown as vertices in
the given network diagram. The number of edges joining the vertices give the shortest
distances, in metres, between locations.
B
40
C
70
50
70
90
40
A
80
80
Pump
120
E
70
90
40
50
80
F
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 2 steps
