ホーム > Term: Prim-Jarnik algorithm
Prim-Jarnik algorithm
Compute a minimum spanning tree by beginning with any vertex as the current tree. At each step add a least edge between any vertex not in the tree and any vertex in the tree. Continue until all vertices have been added.
- スピーチの一部 noun
- 産業/ドメイン コンピュータサイエンス
- カテゴリ Algorithms & data structures
- Government Agency: NIST
0
作成者
- GeorgeV
-
(Gold) 1123 ポイント - 100% positive feedback
