IB MAI HL Geometry & Trigonometry Topic 3.7 Graph Theory (id: e98e59e93)

本题目来源于试卷: IB MAI HL Geometry & Trigonometry Topic 3.7 Graph Theory，类别为 IB数学

[问答题]
George, an experienc8,6)b 5t y wcwwl/7bto2 arcgb7qrm;oedm 2u(so) ja+nzb(mw: )kquj(m civil engineer, is designing a high-speed railway network to connect seven cities (A-G), as illajw k:u((juzo)nmqm +(ms b)2 ustrated 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.

参考答案:



本题详细解析: 暂无

微信扫一扫，分享更方便