Edexcel IAL · Mathematics · WDM11 · Algorithms on graphs
Topic Questions: 2.1 The minimum spanning tree (minimum connector) problem. Prim's algorithm. — WDM11 Algorithms on graphs
26 WDM11 Algorithms on graphs topic questions are tagged to this syllabus point across 15 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 15 WDM11 papers across 2019–2026, contributing 26 topic questions and 58 marks. The most recent appearance is WDM11/01 January 2026. That equals 38.2% of the 68 topic questions and 29.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 | Q6 Travelling Salesman Problem - Edexcel IAL D1 Jan 2026 Q6 |
FRQ | 1 of 4 parts ((c)) | 4 of 10 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 ((a), (b)) | 4 of 8 on the paper |
Easy | Go to Practice Hub |
| WDM11/01June 2025 · Edexcel IAL | Q2 Prim's, Nearest Neighbour, and Lower Bounds - Edexcel IAL D1 2025 Q2 |
FRQ | 1 of 4 parts ((a)) | 2 of 9 on the paper |
Easy | Go to Practice Hub |
| WDM11/01January 2025 · Edexcel IAL | Q6 Travelling Salesman Problem - Edexcel IAL D1 2025 Jan Q6 |
FRQ | 1 of 7 parts ((b)) | 3 of 13 on the paper |
Easy | Go to Practice Hub |
| WDM11/01June 2024 · Edexcel IAL | Q3 Dijkstra's Algorithm and MST - Edexcel IAL D1 2024 Q3 |
FRQ | 1 of 2 parts ((b)) | 2 of 8 on the paper |
Medium | Go to Practice Hub |
| WDM11/01June 2024 · Edexcel IAL | Q4 Network Routing and TSP - Edexcel IAL D1 2024 Q4 |
FRQ | 2 of 6 parts ((a), (b)) | 4 of 14 on the paper |
Medium | Go to Practice Hub |
| WDM11/01January 2024 · Edexcel IAL | Q2 Algorithms on Graphs - Edexcel IAL D1 Jan 2024 Q2 |
FRQ | 2 of 5 parts ((a), (b)) | 4 of 10 on the paper |
Easy | Go to Practice Hub |
| WDM11/01June 2023 · Edexcel IAL | Q7 Travelling Salesman Problem and Prim's Algorithm - Edexcel IAL D1 June 2023 Q7 |
FRQ | 1 of 5 parts ((a)) | 3 of 12 on the paper |
Medium | Go to Practice Hub |
| WDM11/01January 2023 · Edexcel IAL | Q5 Algorithms on Graphs - Edexcel IAL Decision Mathematics D1 Jan 2023 Q5 |
FRQ | 3 of 5 parts ((c), (d), (e)) | 6 of 9 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 | 2 of 8 parts ((b), (c)) | 4 of 14 on the paper |
Medium | Go to Practice Hub |
| WDM11/01January 2022 · Edexcel IAL | Q6 Dijkstra, Nearest Neighbour and Travelling Salesman - Edexcel IAL D1 Jan 2022 Q6 |
FRQ | 1 of 4 parts ((c)) | 4 of 14 on the paper |
Medium | Go to Practice Hub |
| WDM11/01October 2021 · Edexcel IAL | Q3 Algorithms on graphs II - Edexcel IAL D1 October 2021 Q3 |
FRQ | 2 of 7 parts ((a), (b)) | 4 of 15 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 | 2 of 5 parts ((a), (e)) | 6 of 15 on the paper |
Medium | Go to Practice Hub |
| WDM11/01January 2021 · Edexcel IAL | Q4 Travelling Salesperson Problem - Edexcel IAL D1 2021 Jan Q4 |
FRQ | 1 of 7 parts ((d)(i)) | 2 of 12 on the paper |
Easy | Go to Practice Hub |
| WDM11/01January 2020 · Edexcel IAL | Q2 Algorithms on graphs - Edexcel IAL D1 2020 Jan Q2 |
FRQ | 2 of 4 parts ((a)(i), (a)(ii)) | 3 of 8 on the paper |
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 ((b), (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?
- 16 question stems cover this subtopic across 15 papers, but only 26 tagged parts and 58 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.