Skip to content
Topic D1.3A Level Decision Mathematics 1 (D1)

Networks

Minimum spanning trees (Kruskal's and Prim's), shortest path (Dijkstra's). Master this topic with practice questions from real A Level Decision Mathematics 1 (D1) past papers.

networksKruskalPrimDijkstra
Practice Networks QuestionsPast Papers

What You'll Learn in Networks

1

networks

Practice networks questions from A Level Decision Mathematics 1 (D1) exams.

2

Kruskal

Practice Kruskal questions from A Level Decision Mathematics 1 (D1) exams.

3

Prim

Practice Prim questions from A Level Decision Mathematics 1 (D1) exams.

4

Dijkstra

Practice Dijkstra questions from A Level Decision Mathematics 1 (D1) exams.

Generate a Custom Worksheet

Create a practice worksheet with Networks questions from multiple years of A Level Decision Mathematics 1 (D1) past papers.

Generate Worksheet

More Topics in Decision Mathematics 1 (D1)

AlgorithmsGraph TheoryNetworksRoute InspectionCritical Path AnalysisLinear Programming
PreviousGraph TheoryNextRoute Inspection

All 6 topics in A Level Decision Mathematics 1 (D1)

← Back to Decision Mathematics 1 (D1)
Pure Mathematics 1 (P1)Pure Mathematics 2 (P2)Pure Mathematics 3 (P3)