Prims algorithm from tables

i dont know if this came up in D1, but for my D2 question i need to use Prims algorithm using a table to find a minimum connector and min spanning tree. i can do this fine on network drawings, but cant think how to do it on a table. ive attached the table, hopefully its clear, but i managed to get:
BCFDEA and total: 413 for this.

can someone please tell me how to go about doing Prims on table? its easy but i cant think lol!

table.bmp494.9KB

Reply 1

Dez

Amazingly, I just did this question. D2 2002 Q6, yes? I got a total of 372, as so:

A--B--C--F--E
         |
         D

Maybe you need to go back and revise the method for this. You have to label the starting column, line out the row, and look for the smallest number to connect to it. You should end up with a table with a bunch of lines out and labels at the top (1, 2, 3, 5, 6, 4).

This comes up pretty frequently I've found, so make sure you know what to do in it.