Answered step by step
Verified Expert Solution
Question
1 Approved Answer
BOS BWIDFW JFK LAX PVD SFO 2704 MIAORD | 1258 946 1121 1090 740 2342 235 1464 187 184 BOS BWI DFW JFK LAX |
BOS BWIDFW JFK LAX PVD SFO 2704 MIAORD | 1258 946 1121 1090 740 2342 235 1464 187 184 BOS BWI DFW JFK LAX | ORD PVD SFO 144 1391 1235 337 946 1090 2342 1258 867 1121 802 849 1846 849 1846 2704 1464 337 a. Assuming the numbers are miles, provide a Dijkstra table for the shortest paths from SFO. b. Assuming the numbers are miles, provide a Prim's table for the minimum spanning tree starting from MIA, c. Assuming the numbers are miles, provide the Union by Size table for Kruskal's. When two trees have the same size, have the airport with the smaller index be the new root. d. Assuming the numbers are the number of people possible to carry between cities, apply Ford-Fulkersons to determine the number of people that can get from LAX to JFK Table format for parts a and b | Table format format for part c, Kruskal's Known dy 0 BOS 1 BWI 2 DFW 3 JFK 4 5 LAXMIA 6 ORD 7 PVD 8 SFO BOS BWI DFW JFK LAX MIA ORD PVD SFO ORD PVD SFO Table format for Ford-Fulkerson Solution. Number of passengers flying between cities. Destinations BOS BWI DFWJFK LAX MIA BOS X BWI DFW JFK Origins | LAX MIA ORD PVD SFO BOS BWIDFW JFK LAX PVD SFO 2704 MIAORD | 1258 946 1121 1090 740 2342 235 1464 187 184 BOS BWI DFW JFK LAX | ORD PVD SFO 144 1391 1235 337 946 1090 2342 1258 867 1121 802 849 1846 849 1846 2704 1464 337 a. Assuming the numbers are miles, provide a Dijkstra table for the shortest paths from SFO. b. Assuming the numbers are miles, provide a Prim's table for the minimum spanning tree starting from MIA, c. Assuming the numbers are miles, provide the Union by Size table for Kruskal's. When two trees have the same size, have the airport with the smaller index be the new root. d. Assuming the numbers are the number of people possible to carry between cities, apply Ford-Fulkersons to determine the number of people that can get from LAX to JFK Table format for parts a and b | Table format format for part c, Kruskal's Known dy 0 BOS 1 BWI 2 DFW 3 JFK 4 5 LAXMIA 6 ORD 7 PVD 8 SFO BOS BWI DFW JFK LAX MIA ORD PVD SFO ORD PVD SFO Table format for Ford-Fulkerson Solution. Number of passengers flying between cities. Destinations BOS BWI DFWJFK LAX MIA BOS X BWI DFW JFK Origins | LAX MIA ORD PVD SFO
Step by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started