Edexcel IAL · Mathematics · WDM11 · A Level

WDM11 Algorithms on graphs Topic Questions

Every WDM11 Algorithms on graphs 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 3 subtopics 68 topic questions 16 papers 199 tagged marks

Back to Algorithms on graphs All paper codes

Core finding

2.1 The minimum spanning tree (minimum connector) problem. Prim's… is the most frequently assessed subtopic in Algorithms on graphs, with 26 topic questions and 58 marks across 15 papers. 2.3 Dijkstra's algorithm for finding the shortest path. follows with 26 topic questions and 109 marks. The topic contains 3 subtopics, 68 topic questions and 199 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

2.1 The minimum spanning tree (minimum connector) problem. Prim's algorithm. 15 papers

2636.1%

2.3 Dijkstra's algorithm for finding the shortest path. 16 papers

2636.1%

2.2 The minimum spanning tree (minimum connector) problem. Kruskal's algorithm. 8 papers

2027.8%

Marks by subtopic

marks

2.3 Dijkstra's algorithm for finding the shortest path. 16 papers

10953.2%

2.1 The minimum spanning tree (minimum connector) problem. Prim's algorithm. 15 papers

5828.3%

2.2 The minimum spanning tree (minimum connector) problem. Kruskal's algorithm. 8 papers

3818.5%

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
2.1 The minimum spanning tree (minimum connector) problem. Prim's algorithm.	26	15	58	2019–2026	Open topic questions
2.2 The minimum spanning tree (minimum connector) problem. Kruskal's algorithm.	20	8	38	2019–2026	Open topic questions
2.3 Dijkstra's algorithm for finding the shortest path.	26	16	109	2019–2026	Open topic questions

Browse every topic question

2.1 The minimum spanning tree (minimum connector) problem. Prim's algorithm. 26 question items · 15 papers 58 marks · 2019–2026 2.2 The minimum spanning tree (minimum connector) problem. Kruskal's algorithm. 20 question items · 8 papers 38 marks · 2019–2026 2.3 Dijkstra's algorithm for finding the shortest path. 26 question items · 16 papers 109 marks · 2019–2026

Topic question rules and edge cases

How many subtopics does Algorithms on graphs contain?: This page lists 3 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.