Home > A-Level Further Maths > Teaching Order Year 1 > 08: Modelling with Algorithms - Kruskal's, Prim's & Dijkstra's Algorithms > a. Minimum Spanning Trees

01 Introduction & Greedy Algorithms

02 Kruskal’s Algorithm Example 1

03 Kruskal’s Algorithm Example 2

04 Prim’s Algorithm Example 1

05 Prim’s Algorithm Example 2

06 Prim’s Algorithm with a Matrix Example 1

07 Prim’s Algorithm with a Matrix Example 2