MATRIX FORM OF PRIMS ALGORITHM

1
MATRIX FORM OF PRIMS ALGORITHM
2
This network may be described using a Distance
Matrix
3
Step 1 Choose a starting vertex and delete all
elements in that vertexs row and arrow its
column
Step 2 Neglecting all deleted terms, scan all
arrowed columns for the lowest available
element and circle that element
Step 3 Delete the circled elements row and
arrow its column
Step 4 Repeat steps 2 and 3 until all rows
deleted
Step 5 The spanning tree is formed by the
circled arcs
4
Start with A
Now we have vertex B
Now we have vertex D
Now we have vertex F
Now we have vertex E
Now we have vertex C
1
Scan all arrowed columns and find lowest element
2
3
4
5
6
Delete its row arrow its column
These arcs, in this order, will provide a minimum
spanning tree
Write down the arcs in the order you select them
AB
BD
DF
FE
BC