Edexcel IAL · Mathematics · WDM11 · Algorithms on graphs
Topic Questions: 2.2 The minimum spanning tree (minimum connector) problem. Kruskal's algorithm. — WDM11 Algorithms on graphs
20 WDM11 Algorithms on graphs topic questions are tagged to this syllabus point across 8 papers (2019–2026). Only the parts whose knowledge graph matches this syllabus statement are counted, and the table shows which parts of each question are involved.
Core finding
This Algorithms on graphs syllabus point appears in 8 WDM11 papers across 2019–2026, contributing 20 topic questions and 38 marks. The most recent appearance is WDM11/01 January 2026. That equals 29.4% of the 68 topic questions and 19.1% of the 199 marks tagged to Algorithms on graphs. Only parts tagged to this subtopic are counted, so a four-part question can contribute one item and one part's marks. The table lists every matching question, its tagged parts and marks, with a link back to the paper page. Sessions are newest first, so the statement can be traced back through the full paper history.
Topic questions by session
Newest sessions first. Parts and marks count only the parts tagged to this subtopic; “x of y parts” shows how much of the question is tagged elsewhere. Select the paper cell to open the matching question on the paper page, or use Go to Practice Hub to answer that exact question in the Interactive Practice Hub.
| Paper | Question | Type | Parts | Marks | Difficulty | Practice |
|---|---|---|---|---|---|---|
| WDM11/01January 2026 · Edexcel IAL | Q3 Kruskal's & Route Inspection - Edexcel IAL D1 Jan 2026 Q3 |
FRQ | 3 of 5 parts ((i)(a), (i)(b), (i)(c)) | 5 of 13 on the paper |
Medium | Go to Practice Hub |
| WDM11/02January 2026 · Edexcel IAL | Q2 Prim's and Kruskal's Algorithms - Edexcel IAL D1 Jan 2026 Q2 |
FRQ | 2 of 4 parts ((c), (d)) | 4 of 8 on the paper |
Easy | Go to Practice Hub |
| WDM11/01June 2022 · Edexcel IAL | Q3 Minimum Spanning Trees & Travelling Salesman - Edexcel IAL D1 June 2022 Q3 |
FRQ | 1 of 8 parts ((a)) | 3 of 14 on the paper |
Medium | Go to Practice Hub |
| WDM11/01January 2022 · Edexcel IAL | Q2 Graphs and Kruskal's Algorithm - Edexcel IAL D1 Jan 2022 Q2 |
FRQ | 4 of 5 parts ((a), (c), (d), (e)) | 6 of 7 on the paper |
Easy | Go to Practice Hub |
| WDM11/01June 2021 · Edexcel IAL | Q7 Prim's Algorithm and Linear Programming Constraints - Edexcel IAL Decision Mathematics D1 June 2021 Q7 |
FRQ | 1 of 5 parts ((a)) | 2 of 15 on the paper |
Medium | Go to Practice Hub |
| WDM11/01October 2020 · Edexcel IAL | Q1 Algorithms on graphs - Edexcel IAL D1 2020 Jun Q1 |
FRQ | 3 parts ((a), (b), (c)) | 7 | Easy | Go to Practice Hub |
| WDM11/01January 2020 · Edexcel IAL | Q2 Algorithms on graphs - Edexcel IAL D1 2020 Jan Q2 |
FRQ | 4 parts ((a)(i), (a)(ii), (b), (c)) | 8 | Easy | Go to Practice Hub |
| WDM11/01June 2019 · Edexcel IAL | Q2 Algorithms on graphs - Edexcel IAL D1 2019 Jun Q2 |
FRQ | 2 of 4 parts ((c), (d)) | 3 of 11 on the paper |
Easy | Go to Practice Hub |
Related topic questions in Algorithms on graphs
Topic question rules and edge cases
- How many topic questions cover this syllabus point?
- 8 question stems cover this subtopic across 8 papers, but only 20 tagged parts and 38 marks belong to it. Other parts of the same questions are assessed under different statements and are excluded from this page.
- Which papers include this subtopic?
- The table lists every matching session from 2019–2026. Each row links to the question anchor on the paper page, where the full paper context and practice entry point are available.
- Why can one question appear under several subtopics?
- The parts of one question can assess different syllabus statements. Each part is counted under its own subtopics, so the same question stem can appear on several subtopic pages while each page lists only the parts and marks tagged to that statement.
- Can I practise these questions with AI marking?
- Yes. Open a paper from the table and use the Interactive Practice Hub entry point. The page itself is static HTML so search engines and retrieval agents can read the full question list without executing JavaScript.