Click repeatedly on the graph to obtain the minimum spanning tree (or minimum connector ).
Software/Applets used on this page
thanks to Kenji Ikeda
Glossary
graph
A diagram showing a relationship between two variables.
The diagram shows a vertical y axis and a horizontal x axis.
The diagram shows a vertical y axis and a horizontal x axis.
minimum connector
A minimum spanning tree.
minimum spanning tree
A spanning tree such that the total length of its edges is as small as possible.
spanning tree
A subgraph which includes all the vertices of a graph and is also a tree.
tree
A connected graph with no cycles.
This question appears in the following syllabi:
| Syllabus | Module | Section | Topic | Exam Year |
|---|---|---|---|---|
| AQA A-Level (UK - Pre-2017) | D1 | Algorithms on graphs | Minimum connector | - |
| AQA AS Further Maths 2017 | Discrete Maths | Networks | Minimum Connector | - |
| AQA AS/A2 Further Maths 2017 | Discrete Maths | Networks | Minimum Connector | - |
| Edexcel A-Level (UK - Pre-2017) | D1 | Algorithms on graphs | Minimum connector | - |
| Edexcel AS Further Maths 2017 | Decision Maths 1 | Algorithms on Graphs | Minimum Connector | - |
| Edexcel AS/A2 Further Maths 2017 | Decision Maths 1 | Algorithms on Graphs | Minimum Connector | - |
| I.B. Higher Level | 10 | Algorithms on graphs | Minimum connector | - |
| OCR A-Level (UK - Pre-2017) | D1 | Algorithms on graphs | Minimum connector | - |
| OCR AS Further Maths 2017 | Discrete Maths | Network Algorithms | Minimum Connector | - |
| OCR MEI AS Further Maths 2017 | Modelling with Algorithms | Networks | Minimum Connector | - |
| OCR-MEI A-Level (UK - Pre-2017) | D1 | Algorithms on graphs | Minimum connector | - |
| Universal (all site questions) | A | Algorithms on graphs | Minimum connector | - |