Prim's algorithm

HideShow resource information
View mindmap
  • Prim's algorithm
    • 2. Select an arc of least weight that joins a vertex that is already in the tree to a vertex that is not yet in the tree.
      • If there us a choice of arcs of equal weight, choose randomly.
    • 1. Choose any vertex to start the tree.
    • 4. Repeat step 2 until all vertices are connected.
    • 3. From any vertex on the tree so far, add the shortest edge that connects to a new vertex.


No comments have yet been made

Similar Mathematics resources:

See all Mathematics resources »See all Networks, algorithms and problem solving resources »