Question: In the graph below, vertices represent cities, and the edges represent potential railroad tracks. The weights on each edge represent the cost in millions of
In the graph below, vertices represent cities, and the edges represent potential railroad tracks. The weights on each edge represent the cost in millions of dollars to build a railroad between the two cities. Build a train system to connect these cities for the least cost possible.
a) Show all your steps (mark selected tracks on the graph below).

b) Which algorithm did you pick? Why?
c) What is the total cost of your railroad?
Graph theory please answer all the questions
Pewter City 2 Viridian City 11 Cerulean City Celadon City Pallet Town 7 19 16 3 5 5 13 Saffron City Vermillion City Fuchsia City Cinnabar Island Lavender Town
Step by Step Solution
3.44 Rating (151 Votes )
There are 3 Steps involved in it
aUsing Kruskals algorithm to find the minimum spanning tree for this graph for this first list all t... View full answer
Get step-by-step solutions from verified subject matter experts
