摘要
普里姆(Prim)算法是实现图的最小生成树的最常用算法。该文主要介绍普里姆(Prim)算法的实现方法,并对普里姆(Prim)算法的效率进行分析。
Prim's Algorithm is used the most frequently in constructing the minimum-cost spanning tree of the graph.The paper aims to introduce the approach to realization of Prim's Algorithm and makes an analysis of its efficiency.
出处
《电脑知识与技术》
2011年第9X期6711-6712,共2页
Computer Knowledge and Technology
