MATRIX FORM OF PRIM’S ALGORITHM

This network may be described using a Distance Matrix

Step 1: Choose a starting vertex and delete all elements in that vertex’s 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 element’s 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

Start with A Delete its row & arrow its column 1Scan all arrowed columns and find lowest element Now we have vertex B 2 Write down the arcs in the order you select them AB 3 BD Now we have vertex DNow we have vertex F 4 DF Now we have vertex E 5 FE Now we have vertex C 6 BC These arcs, in this order, will provide a minimum spanning tree