题库网 (tiku.one)

 找回密码
 立即注册

手机扫一扫,访问本页面

开启左侧

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

[复制链接]
admin 发表于 2024-2-20 20:52:19 | 显示全部楼层 |阅读模式
本题目来源于试卷: IB MAI HL Geometry & Trigonometry Topic 3.7 Graph Theory,类别为 IB数学

[问答题]
George, an experienced civil engineer, is designing a high-speed rai0 7ctl,3/ulhf yeid)d(hj4; eojs)nllgth0c mk(4u)mp8 na m8way network to connect seven cities (A-G), as illustrated in the graph below. The pospkmh4 )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.




参考答案:



本题详细解析: 暂无

微信扫一扫,分享更方便

帖子地址: 

回复

使用道具 举报

您需要登录后才可以回帖 登录 | 立即注册

本版积分规则

浏览记录|手机版首页|使用帮助|题库网 (https://tiku.one)

GMT+8, 2025-9-19 04:50 , Processed in 0.033432 second(s), 29 queries , Redis On.

搜索
快速回复 返回顶部 返回列表