Go to content
Click repeatedly on the graph to obtain the minimum spanning tree (or minimum connector ).

Software/Applets used on this page

Kenji Ikeda
thanks to Kenji Ikeda

This question appears in the following syllabi:

SyllabusModuleSectionTopicExam Year
AQA A-Level (UK - Pre-2017)D1Algorithms on graphsMinimum connector-
AQA AS Further Maths 2017Discrete MathsNetworksMinimum Connector-
AQA AS/A2 Further Maths 2017Discrete MathsNetworksMinimum Connector-
Edexcel A-Level (UK - Pre-2017)D1Algorithms on graphsMinimum connector-
Edexcel AS Further Maths 2017Decision Maths 1Algorithms on GraphsMinimum Connector-
Edexcel AS/A2 Further Maths 2017Decision Maths 1Algorithms on GraphsMinimum Connector-
I.B. Higher Level10Algorithms on graphsMinimum connector-
OCR A-Level (UK - Pre-2017)D1Algorithms on graphsMinimum connector-
OCR AS Further Maths 2017Discrete MathsNetwork AlgorithmsMinimum Connector-
OCR MEI AS Further Maths 2017Modelling with AlgorithmsNetworksMinimum Connector-
OCR-MEI A-Level (UK - Pre-2017)D1Algorithms on graphsMinimum connector-
Universal (all site questions)AAlgorithms on graphsMinimum connector-