[問題] 何謂 bottleneck spanning tree ?
何謂 Bottleneck Spanning Tree ?
課本(Introduction to Algorithms , 3ed)給的定義看不懂
上頭說：A bottleneck spanning tree T of an undirected graph G is a
spanning tree of G whose largest edge weight is minimum over
all spanning trees of G. We say that the value of the
bottleneck spanning tree is the weight of the maximum-weight
edge in T.
上WIKI查也看不懂
WIKI說：A bottleneck edge is the highest weighted edge in a spanning tree.
A spanning tree is a minimum bottleneck spanning tree (or MBST)
if the graph does not contain a spanning tree with a smaller
bottleneck edge weight.
找了一些中文網頁 也還是看不懂
請高手解釋 謝謝
--
※ 發信站: 批踢踢實業坊(ptt.cc)
◆ From: 111.255.5.236
推
12/19 19:59, , 1F
12/19 19:59, 1F
→
12/19 19:59, , 2F
12/19 19:59, 2F
→
12/19 19:59, , 3F
12/19 19:59, 3F
→
12/19 20:00, , 4F
12/19 20:00, 4F
→
12/19 20:01, , 5F
12/19 20:01, 5F
→
12/19 20:01, , 6F
12/19 20:01, 6F
→
12/19 22:52, , 7F
12/19 22:52, 7F
→
12/19 22:52, , 8F
12/19 22:52, 8F
→
12/19 22:52, , 9F
12/19 22:52, 9F
推
12/20 04:35, , 10F
12/20 04:35, 10F
→
12/20 04:35, , 11F
12/20 04:35, 11F
推
12/20 09:18, , 12F
12/20 09:18, 12F
→
12/20 09:21, , 13F
12/20 09:21, 13F
→
12/20 09:21, , 14F
12/20 09:21, 14F
→
12/20 09:22, , 15F
12/20 09:22, 15F
→
12/20 09:22, , 16F
12/20 09:22, 16F