12. Starting at the pipe, determine the minimum length of pipe needed. 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 70 50 70 90 A. 40 80 80 70 Pump 120 E 70 80 90' 50 80 10. You've been asked to determine the shortest distance from each house to the pump before lay pipes. (1 × 8 = 8 marks) The committee also suggested that it would be better to have one common pipeline which covers each house in the Zone. 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. 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 70 50 70 90 A. 40 80 80 70 Pump 120 E 70 80 90' 50 80 10. You've been asked to determine the shortest distance from each house to the pump before lay pipes. (1 × 8 = 8 marks) The committee also suggested that it would be better to have one common pipeline which covers each house in the Zone. 11. Redraw the diagram and draw the shortest path they could use to lay pipes.
Advanced Engineering Mathematics
10th Edition
ISBN:9780470458365
Author:Erwin Kreyszig
Publisher:Erwin Kreyszig
Chapter2: Second-order Linear Odes
Section: Chapter Questions
Problem 1RQ
Related questions
Question
Draw and complete solution topic is “Graphs and Networks”
Transcribed Image Text:12. Starting at the pipe, determine the minimum length of pipe needed.
Transcribed Image Text: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
70
50
70
90
A.
40
80
80
70
Pump
120
E
70
80
90'
50
80
10. You've been asked to determine the shortest distance from each house to the pump
before lay pipes.
(1 × 8 = 8 marks)
The committee also suggested that it would be better to have one common pipeline which
covers each house in the Zone.
11. Redraw the diagram and draw the shortest path they could use to lay pipes.
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 1 steps
Recommended textbooks for you
Advanced Engineering Mathematics
Advanced Math
ISBN:
9780470458365
Author:
Erwin Kreyszig
Publisher:
Wiley, John & Sons, Incorporated
Numerical Methods for Engineers
Advanced Math
ISBN:
9780073397924
Author:
Steven C. Chapra Dr., Raymond P. Canale
Publisher:
McGraw-Hill Education
Introductory Mathematics for Engineering Applicat…
Advanced Math
ISBN:
9781118141809
Author:
Nathan Klingbeil
Publisher:
WILEY
Advanced Engineering Mathematics
Advanced Math
ISBN:
9780470458365
Author:
Erwin Kreyszig
Publisher:
Wiley, John & Sons, Incorporated
Numerical Methods for Engineers
Advanced Math
ISBN:
9780073397924
Author:
Steven C. Chapra Dr., Raymond P. Canale
Publisher:
McGraw-Hill Education
Introductory Mathematics for Engineering Applicat…
Advanced Math
ISBN:
9781118141809
Author:
Nathan Klingbeil
Publisher:
WILEY
Mathematics For Machine Technology
Advanced Math
ISBN:
9781337798310
Author:
Peterson, John.
Publisher:
Cengage Learning,
