Pengguna:Chinamoonroll/bak pasir: Perbedaan antara revisi

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. A MST is necessarily a MBST (provable by the [[#Cut property|cut property]]), but a MBST is not necessarily a MST.<ref>{{cite web|url=http://flashing-thoughts.blogspot.ru/2010/06/everything-about-bottleneck-spanning.html|title=Everything about Bottleneck Spanning Tree|author=|date=|website=flashing-thoughts.blogspot.ru|accessdate=4 April 2018}}</ref><ref>http://pages.cpsc.ucalgary.ca/~dcatalin/413/t4.pdf</ref>

 

{{Reflist|30em}}