x Turn on thread page Beta
 You are Here: Home >< Maths

Prims algorithm from tables watch

1. 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!
Attached Images

2. Amazingly, I just did this question. D2 2002 Q6, yes? I got a total of 372, as so:
Code:
```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.
3. (Original post by Dez)
Amazingly, I just did this question. D2 2002 Q6, yes? I got a total of 372,
yes thats the right question. thanks, i'll go over it now and try a few.

TSR Support Team

We have a brilliant team of more than 60 Support Team members looking after discussions on The Student Room, helping to make it a fun, safe and useful place to hang out.

This forum is supported by:
Updated: April 13, 2006
Today on TSR

How much will your degree earn you?

Find out where yours ranks...

Poll
Useful resources

Maths Forum posting guidelines

Not sure where to post? Read the updated guidelines here

How to use LaTex

Writing equations the easy way

Study habits of A* students

Top tips from students who have already aced their exams

Chat with other maths applicants