Why don't you start by using A,B,C,D,E,F instead of those silly confusing names?!
Then go here: Kruskal's algorithm - Wikipedia, the free encyclopedia
This is from AQA decision 1 maths book.
The distance chart below gives the distances, in miles, between six towns in northern England.
Bradford(B)
10 Halifax (Hal)
20 30 Harrogate (Har)
12 8 32 Huddersfield (Hud)
13 22 19 24 Leeds (L)
15 22 32 14 12 Wakefield(W)
(a) Using Kruskal's algorithm and showing your working at each stage, find a minimum spanning tree for these six towns.
I got HalHud,BHal, LW, BL, BHar
But the correct answer is HalHud, BHal, LW, LB, HarL.
HARL?? how come its HARL impossible!
(b) State the length of your minimum spanning tree.
I got 8+10+12+13+20 = 63. BUT the correct answer is 62!! OMG
Why don't you start by using A,B,C,D,E,F instead of those silly confusing names?!
Then go here: Kruskal's algorithm - Wikipedia, the free encyclopedia