[问答题]
George, an experienced civ
j09h b: d,drifil engineer, is designing a high-speed r
:xj)nii , a.1xv;0wdkhuw ;ehailway network to connect sev
:uiva) i,jx; wdhex1kh0w; .nen cities (A-G), as illustrated in the graph below. The possible 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.
