[问答题]
George, an experienced civil engineer, is designing a high-speed rai
0 7ctl,3/ulhf yeid)d(hj4; eojs)nll
gth0c mk(4u)mp8 na m8way network to connect seven cities (A-G), as illustrated in the graph below. The pos
pkmh4 )ta(0 uc88mmgn sible railways and costs of building them are represented by the graph edges, where costs are in billions of dollars.
George needs to design the lowest cost high-speed railway network that will connect the seven cities. Each city does not need to directly connect with all other cities, however each city must have a connection to the rail network.
1.Name an algorithm which will allow George to find the lowest cost high-speed railway network.
2.(1)Find and list the railway connections of the lowest cost high-speed railway network.
(2)Hence, write down the cost of building this network.