普林演算法
Sign in to saveAlso known as DJP algorithm, Jarník algorithm, Prim–Jarník algorithm, Prim–Dijkstra algorithm, Jarnik algorithm
algorithm for finding the minimum spanning tree for weighted undirected graphs
In the Vinony graph
Within Vinony's link graph, 普林演算法 is referenced by 169 other articles, and connects out to time complexity, Bellman–Ford algorithm and glossary of graph theory terms.
It is catalogued under topics including Graph algorithms, Greedy algorithms and Spanning tree.
Its subject is documented across 32 Wikipedia language editions.
Wikidata facts
Show 1 more fact
- Commons category
- Prim's algorithm
Sources (2)
via Wikidata · CC0
Article · 中文
普里姆算法（Prim's algorithm）是图论中的一种贪心算法，可在一个加权连通图中找到其最小生成树。意即由此算法搜索到的边子集所构成的树中，不但包括了连通图里的所有顶点，且其所有边的权值之和亦为最小。该算法于1930年由捷克数学家发现；并在1957年由美国计算机科学家独立发现；1959年，艾兹格·迪科斯彻再次发现了该算法。因此，在某些场合，普里姆算法又被称为DJP算法、亚尔尼克算法或普里姆－亚尔尼克算法。
Abstract from DBpedia / Wikipedia · CC BY-SA