题库网 (tiku.one)

 找回密码
 立即注册

手机扫一扫,访问本页面

开启左侧

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

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

[问答题]
A biotechnology company is inve2 6hbpy60 r bk z-zee-ci9l7wistigatil iuhnp017/ qhe1enp 4ng the costs of building a fibre optic network to connect the 8 research labs it owns. The weighted graph below shows the labq nehhi/ e47pn1l1p0us (A-H) and the cost, in thousands of dollars, for building each connection.
Due to the fast information flow provided by fibre optic networks, the company decides that each lab does not need to be directly connected to each other, however each lab needs to have a connection to the overall network.

1.(1)Using Kruskal's algorithm, find a minimum spanning tree for the graph. Clearly indicate the order in which the edges are added to the tree.
(2)Hence draw the minimum spanning tree for the graph.
2.Find the minimum cost of building the fibre optic network.




参考答案:



本题详细解析: 暂无

微信扫一扫,分享更方便

帖子地址: 

回复

使用道具 举报

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

本版积分规则

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

GMT+8, 2024-10-5 00:35 , Processed in 0.060337 second(s), 28 queries , Redis On.

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