You are on page 1of 3
PVulndee, L/23/g— dar &) Travel to SLCC’s Campuses Project 2 Below is a map of SLCC’s five main campuses. On a separate paper, draw a graph of the map. The campuses are the vertices —use T for Taylorsville, | for Jordan, § for South City, M for Miller, and B for Meadowbrook. The weights of the edges are the distances between campuses: Taylorsville to South City: 8 miles South City to Meadowbrook: 4.5 miles Taylorsville to Meadowbrook: 3.6 miles South City to Miller: 12.3 miles Taylorsville to Miller: 9.3 miles Meadowbrook to Miller: 9.6 miles Jordan to Taylorsville: 9 miles Meadowbrook to Jordan: 12 miles Jordan to South City: 16 miles Miller to Jordan: 5 miles SS SSperacinatns7 Colson ures bids eee SO Cons Cosa MiIexectui 7 USE A SEPARATE PAPER TO ANSWER THE FOLLOWING. CLEARLY SHOW YOUR WORK AND ANSWERS. 1. Uist a possible Hamiltonian circuit, starting and ending at the Jordan Campus. What would be the total weight? 2. Apply the Nearest Neighbor Algorithm to the graph. Write your answer as a list of vertices, starting and ending at the Jordan Campus, and find the total weight. 3. Apply the Sorted Edges Algorithm to the graph. Write your answer as a list of vertices, starting and ending at the Jordan Campus. 4, Find the minimum cost (lowest miles) spanning tree using Kruskal's Algorithm, 5. Are any of the above the answers the same? Why or why not. 6. Given your answers above, if you had to travel to all five campuses, which method would you use? Why? | te Pi Matender aN ¥6O 5 sm TS > = 53.7 trial Werth 4 Seg.e 2 = 93.2 tote weiqht SOMTES =53.2 YO > MTes 3 = 3B4 ST43+*3R VAS My IMIG = 38.4 Os Mtb 155 ae 6 ast aurasie “Be [Sess emmy 344 a AQ. ares

You might also like