并行最小生成树算法
[英]Minimum spanning tree algorithm in parallel
问题描述
I know some minimum spanning tree algorithms: Boruvka, Prim and Kruskal. 
我知道一些最小的生成树算法：Boruvka，Prim和Kruskal。 Which of them can be implemented in parallel fashion? 它们中的哪一个可以并行执行？
Thanks! 谢谢！
1 个解决方案
解决方案1
4 已采纳 2012-11-06 19:08:34
Out of these 3 algorithms, only Boruvka algorithm might be easily parallelized. 在这三种算法中，只有Boruvka算法可能很容易并行化。
Quotation from the description of Boruvka algorithm on algoritmy.net : 来自algoritmy.net上Boruvka算法描述的引用 ：
A significant advantage of the Borůvka's algorithm is that is might be easily parallelized, because the choice of the cheapest outgoing edge for each component is completely independent of the choices made by other components.
声明:本站的技术帖子网页，遵循CC BY-SA 4.0协议，如果您需要转载，请注明本站网址或者原文地址。任何问题请咨询:yoyou2525@163.com.