EXM.1.AHL.TZ0.38

pestleMathematicsAIHLPaper 1EXM· ahl-3-16-tree-and-cycle-algorithms-chinese-postman-travelling-salesmansource ↗

The diagram below shows a weighted graph.

Use Prim’s algorithms to find a minimal spanning tree, starting at J. Draw the tree, and find its total weight.

Markscheme / solution

(C4)

Total weight = 17 (A2)

Note: There are other possible spanning trees.

[6 marks]

Examiners’ report

[N/A]