DECISION 1 “It’s obvious” “It’s easy” “I will concentrate on Core because I don’t need to revise for Decision”

Kruskal’s Algorithm What the examiner is looking for A table showing the order in which you have added each edge, starting with the smallest value Each edge added to the table should be in ascending order The total of the spanning tree should be stated You understand that there will be 𝑛−1 edges on your spanning tree (𝑛 being the number of vertices) Your spanning tree is drawn with a ruler and pencil and all vertices are labelled.

CD = 1

CD = 1 DB = 3

CD = 1 DB = 3 GH = 3

CD = 1 DB = 3 GH = 3 BA = 4

CD = 1 DB = 3 GH = 3 BA = 4 DF = 4

CD = 1 DB = 3 GH = 3 BA = 4 DF = 4 FG = 5

CD = 1 DB = 3 GH = 3 BA = 4 DF = 4 FG = 5 GI = 5

CD = 1 DB = 3 GH = 3 BA = 4 DF = 4 FG = 5 GI = 5 GE = 6

Total = 39 CD = 1 DB = 3 GH = 3 BA = 4 DF = 4 FG = 5 GI = 5 GE = 6

Don’t forget to label and number each part of the Spanning Tree

Not to Scale