10. What is the shortest distance from each house to the pump before lay pipes using Dijkstra’s Algorithm11. 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. Graphs and NetworksEngineers decided to pump water from a central tank in each block of houses in theresidential infrastructure. The pump and the eight houses in Zone 1 are shown as vertices inthe given network diagram. The number of edges joining the vertices give the shortestdistances, in metres, between locations.B40C7050709040A8080Pump120E7090405080F

Shortest distance from each house to the pump:We can use Dijkstra's algorithm to find the shortest…

Answered: Graphs and Networks Engineers decided…

Similar questions

Q1. The network in Figure 1 gives distance in miles between pairs of cities 1,2,… and 8. Use Dijkstra’s algorithm to find the shortest route between following cities. Solve the problems using Floyd’s Algorithm as well. a) Cities 1 and 8 b) Cities 2 and 6
3. For the maze shown below, use graph theory to determine whether it is possible to get out from the Entrance to the Exit. Walk through each doorway exactly once and exit the maze with the shortest path/ walking distance. Give justification to your answer why you chose this theory? Compare your answer with another theory/approach? Exit H G F E D B A Entrance
There are 9 towns A, B, C, D, E, F, G, H, I. There are streets between them with distances shown below. Find shortest paths from A to C, A to D, A to E, and A to F. Specify the shortest paths and the shortest path lengths. You must use the Dijkstra’s algorithm table to solve this problem. Show all steps of your work. The streets and distances are AB 2, AG 4, AH 9, AF 6, BC 9, BG 8, CD 5, CG 2, DE 8, DG 3, EF 4, EH 7, EI 3, FH 2, GI 6, HI 5.
matlab t=0 to 10pi; increment as ur wish x=2*sin(t)+0.5*t+e; e is random between 1 to length of t find local maxima &local minima and original graph code,graph needed
Please in python
Problem 2. The two problems below can be solved using graph coloring. For each problem, represent the situation with a graph, say whether you should be coloring vertices or edges and why, and use the coloring to solve the problem. a. Your Quidditch league has 5 teams. You will play a tournament next week in which every team will play every other team once. Each team can play at most one match each day, but there is plenty of time in the day for multiple matches. What is the fewest number of days over which the tournament can take place? b. Ten members of Math Club are driving to a math conference in a neighboring state. However, some of these students have dated in the past, and things are still a little awkward. Each student lists which other students they refuse to share a car with; these conflicts are recorded in the table below. What is the fewest number of cars the club needs to make the trip? Do not worry about running out of seats, just avoid the conflicts. Student: A B C D E F…