Year 12s: what will be the first way you research your future options? >>

AQA D1 Kruskals algorithm question

I'm stuck on question 10a) doing kruskals algorithm, here is the question:

For my working out I have done

I have the wrong order and the wrong length,
the correct order is
GF, BD, EG, DC, HJ, AD, GF, CF
With total length as 31

I have no idea where I have gone wrong, the answer hasn't included I for some reason too and used GF twice so i'm confused

Reply 1

ghostwalker

Original post by Sayless

I have no idea where I have gone wrong, the answer hasn't included I for some reason too and used GF twice so i'm confused

I see nothing wrong with your answer.

Where you have a choice of edges of the same weight, the order can vary. CD then EG, or EG then CD; both are correct.

Regarding the "correct" answer:
There are 10 nodes and so a spanning tree must have 9 edges.
You cannot get a repeated edge.
It must include "I".