Home >  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.

0 0

Penulis

  • GeorgeV
  •  (Gold) 1123 poin
  • 100% positive feedback
© 2024 CSOFT International, Ltd.