For the next two problems use the following graph: 8 10 60 50 30 10 70,...

 

Transcribed Image Text:

For the next two problems use the following graph: 8 10 60 50 30 10 70, 40 60 20 30 40 70 10 20 20 50 80 70 20 70 70 60 90 70 70 5 Starting at city 1, use the nearest neighbor (greedy) algorithm to develop a tour of each node. You do not have to go back to the start. Is this tour optimal? If it is not optimal, can you give a better tour to prove that? Use Kruskel's Algorithm to show the Minimum Spanning Tree of the previous graph. For the next two problems use the following graph: 8 10 60 50 30 10 70, 40 60 20 30 40 70 10 20 20 50 80 70 20 70 70 60 90 70 70 5 Starting at city 1, use the nearest neighbor (greedy) algorithm to develop a tour of each node. You do not have to go back to the start. Is this tour optimal? If it is not optimal, can you give a better tour to prove that? Use Kruskel's Algorithm to show the Minimum Spanning Tree of the previous graph.