# WDM11 Algorithms on graphs II Topic Questions > Edexcel IAL WDM11: every Algorithms on graphs II topic question from 16 papers (2019–2026), grouped by syllabus point. 99 questions, 242 marks, with direct… - Canonical HTML: https://www.examsci.com/topics/edexcel-ial/mathematics/decision-mathematics-1-wdm11/algorithms-on-graphs-ii/ - Markdown mirror: https://www.examsci.com/topics/edexcel-ial/mathematics/decision-mathematics-1-wdm11/algorithms-on-graphs-ii/index.md --- Edexcel IAL · Mathematics · WDM11 · A Level Every WDM11 Algorithms on graphs II topic question from the 2018–current syllabus, drawn from 16 papers (2019–2026) and grouped by syllabus point. Each row opens a page listing the exact question numbers, marks and a direct link into the paper. These are questions by topic, not full papers, so you can revise one topic at a time. - WDM11 - 4 subtopics - 99 topic questions - 16 papers - 242 tagged marks - [Back to Algorithms on graphs II](https://www.examsci.com/topics/edexcel-ial/mathematics/decision-mathematics-1-wdm11/algorithms-on-graphs-ii/) - [All paper codes](https://www.examsci.com/topics/) Core finding **3.1 Algorithm for finding the shortest route around a network… is the most frequently assessed subtopic in Algorithms on graphs II, with 42 topic questions and 124 marks across 16 papers.** 3.3 Determination of upper and lower bounds using minimum… follows with 30 topic questions and 64 marks. The topic contains 4 subtopics, 99 topic questions and 242 marks in total. Rows count only the parts tagged to that subtopic, keep the same colour in both charts and repeat paper count, tagged marks and year range in the native table. ## Topic question count and mark distribution Subtopics are on the vertical axis and sorted from highest to lowest. Only the parts whose knowledge graph matches a subtopic are counted for it, and percentages are each row's share of the tagged total in that chart. A part tagged to several subtopics is counted in each bar, so the bars are not a partition of the topic total. ### Questions by subtopic question items - [3.1 Algorithm for finding the shortest route around a network, travelling along every edge at least once and ending at the start vertex. The network will have up to four odd nodes.](https://www.examsci.com/topics/edexcel-ial/mathematics/decision-mathematics-1-wdm11/algorithms-on-graphs-ii/3-1-algorithm-for-finding-the-shortest-route-around-a-network-travelling-along-every/) (16 papers) — 42 · 40.0% - [3.3 Determination of upper and lower bounds using minimum spanning tree methods.](https://www.examsci.com/topics/edexcel-ial/mathematics/decision-mathematics-1-wdm11/algorithms-on-graphs-ii/3-3-determination-of-upper-and-lower-bounds-using-minimum-spanning-tree-methods/) (15 papers) — 30 · 28.6% - [3.4 The nearest neighbour algorithm.](https://www.examsci.com/topics/edexcel-ial/mathematics/decision-mathematics-1-wdm11/algorithms-on-graphs-ii/3-4-the-nearest-neighbour-algorithm/) (15 papers) — 19 · 18.1% - [3.2 The practical and classical Travelling Salesman problems. The classical problem for complete graphs satisfying the triangle inequality.](https://www.examsci.com/topics/edexcel-ial/mathematics/decision-mathematics-1-wdm11/algorithms-on-graphs-ii/3-2-the-practical-and-classical-travelling-salesman-problems-the-classical-problem/) (9 papers) — 14 · 13.3% ### Marks by subtopic marks - [3.1 Algorithm for finding the shortest route around a network, travelling along every edge at least once and ending at the start vertex. The network will have up to four odd nodes.](https://www.examsci.com/topics/edexcel-ial/mathematics/decision-mathematics-1-wdm11/algorithms-on-graphs-ii/3-1-algorithm-for-finding-the-shortest-route-around-a-network-travelling-along-every/) (16 papers) — 124 · 49.4% - [3.3 Determination of upper and lower bounds using minimum spanning tree methods.](https://www.examsci.com/topics/edexcel-ial/mathematics/decision-mathematics-1-wdm11/algorithms-on-graphs-ii/3-3-determination-of-upper-and-lower-bounds-using-minimum-spanning-tree-methods/) (15 papers) — 64 · 25.5% - [3.4 The nearest neighbour algorithm.](https://www.examsci.com/topics/edexcel-ial/mathematics/decision-mathematics-1-wdm11/algorithms-on-graphs-ii/3-4-the-nearest-neighbour-algorithm/) (15 papers) — 43 · 17.1% - [3.2 The practical and classical Travelling Salesman problems. The classical problem for complete graphs satisfying the triangle inequality.](https://www.examsci.com/topics/edexcel-ial/mathematics/decision-mathematics-1-wdm11/algorithms-on-graphs-ii/3-2-the-practical-and-classical-travelling-salesman-problems-the-classical-problem/) (9 papers) — 20 · 8.0% ## Subtopic comparison matrix Curriculum order is by syllabus number, then alphabetically. Every row links to the matching past-paper question list. | Subtopic | Topic questions | Papers | Marks | Years | | | --- | --- | --- | --- | --- | --- | | **[3.1 Algorithm for finding the shortest route around a network, travelling along every edge at least once and ending at the start vertex. The network will have up to four odd nodes.](https://www.examsci.com/topics/edexcel-ial/mathematics/decision-mathematics-1-wdm11/algorithms-on-graphs-ii/3-1-algorithm-for-finding-the-shortest-route-around-a-network-travelling-along-every/)** | 42 | 16 | 124 | 2019–2026 | [Open topic questions](https://www.examsci.com/topics/edexcel-ial/mathematics/decision-mathematics-1-wdm11/algorithms-on-graphs-ii/3-1-algorithm-for-finding-the-shortest-route-around-a-network-travelling-along-every/) | | **[3.2 The practical and classical Travelling Salesman problems. The classical problem for complete graphs satisfying the triangle inequality.](https://www.examsci.com/topics/edexcel-ial/mathematics/decision-mathematics-1-wdm11/algorithms-on-graphs-ii/3-2-the-practical-and-classical-travelling-salesman-problems-the-classical-problem/)** | 14 | 9 | 20 | 2020–2026 | [Open topic questions](https://www.examsci.com/topics/edexcel-ial/mathematics/decision-mathematics-1-wdm11/algorithms-on-graphs-ii/3-2-the-practical-and-classical-travelling-salesman-problems-the-classical-problem/) | | **[3.3 Determination of upper and lower bounds using minimum spanning tree methods.](https://www.examsci.com/topics/edexcel-ial/mathematics/decision-mathematics-1-wdm11/algorithms-on-graphs-ii/3-3-determination-of-upper-and-lower-bounds-using-minimum-spanning-tree-methods/)** | 30 | 15 | 64 | 2019–2026 | [Open topic questions](https://www.examsci.com/topics/edexcel-ial/mathematics/decision-mathematics-1-wdm11/algorithms-on-graphs-ii/3-3-determination-of-upper-and-lower-bounds-using-minimum-spanning-tree-methods/) | | **[3.4 The nearest neighbour algorithm.](https://www.examsci.com/topics/edexcel-ial/mathematics/decision-mathematics-1-wdm11/algorithms-on-graphs-ii/3-4-the-nearest-neighbour-algorithm/)** | 19 | 15 | 43 | 2019–2026 | [Open topic questions](https://www.examsci.com/topics/edexcel-ial/mathematics/decision-mathematics-1-wdm11/algorithms-on-graphs-ii/3-4-the-nearest-neighbour-algorithm/) | ## Browse every topic question - [3.1 Algorithm for finding the shortest route around a network, travelling along every edge at least once and ending at the start vertex. The network will have up to four odd nodes.](https://www.examsci.com/topics/edexcel-ial/mathematics/decision-mathematics-1-wdm11/algorithms-on-graphs-ii/3-1-algorithm-for-finding-the-shortest-route-around-a-network-travelling-along-every/) — 42 question items · 16 papers — 124 marks · 2019–2026 - [3.2 The practical and classical Travelling Salesman problems. The classical problem for complete graphs satisfying the triangle inequality.](https://www.examsci.com/topics/edexcel-ial/mathematics/decision-mathematics-1-wdm11/algorithms-on-graphs-ii/3-2-the-practical-and-classical-travelling-salesman-problems-the-classical-problem/) — 14 question items · 9 papers — 20 marks · 2020–2026 - [3.3 Determination of upper and lower bounds using minimum spanning tree methods.](https://www.examsci.com/topics/edexcel-ial/mathematics/decision-mathematics-1-wdm11/algorithms-on-graphs-ii/3-3-determination-of-upper-and-lower-bounds-using-minimum-spanning-tree-methods/) — 30 question items · 15 papers — 64 marks · 2019–2026 - [3.4 The nearest neighbour algorithm.](https://www.examsci.com/topics/edexcel-ial/mathematics/decision-mathematics-1-wdm11/algorithms-on-graphs-ii/3-4-the-nearest-neighbour-algorithm/) — 19 question items · 15 papers — 43 marks · 2019–2026 ## Other topics in WDM11 - [Algorithms 75 question items](https://www.examsci.com/topics/edexcel-ial/mathematics/decision-mathematics-1-wdm11/algorithms/) - [Algorithms on graphs 68 question items](https://www.examsci.com/topics/edexcel-ial/mathematics/decision-mathematics-1-wdm11/algorithms-on-graphs/) - [Critical path analysis 98 question items](https://www.examsci.com/topics/edexcel-ial/mathematics/decision-mathematics-1-wdm11/critical-path-analysis/) - [Linear programming 91 question items](https://www.examsci.com/topics/edexcel-ial/mathematics/decision-mathematics-1-wdm11/linear-programming/) ## Topic question rules and edge cases **How many subtopics does Algorithms on graphs II contain?** This page lists 4 subtopics tagged to the current syllabus. They are ordered by syllabus number, then alphabetically, and each row opens a page of matching past-paper questions. **How are the subtopic question and mark totals calculated?** A multiple-choice question contributes one item and its marks to every subtopic it is tagged with. A structured question contributes one item per tagged part, and that part’s marks; untagged parts of the same question are not counted here. A part tagged to several subtopics therefore appears under each of them. **Why do some subtopics have no numbered prefix?** Practical-skills statements and some syllabus bullets are unnumbered. Numbered statements come first; unnumbered statements and ties are sorted alphabetically. **Is the LaTeX rendered without JavaScript?** Yes. Subtopics that contain formulas are converted to static KaTeX HTML during the build, and the KaTeX stylesheet is served from the same site. --- Full page with native tables, bar charts and Practice Hub links: https://www.examsci.com/topics/edexcel-ial/mathematics/decision-mathematics-1-wdm11/algorithms-on-graphs-ii/