A Level Further Maths Revision
A Level Further Maths
For Students Studying AL Further Maths
-
Gain Access to all AJMaths A Level Further Maths Revision Videos
-
Gain Access to all AJMaths A Level Further Maths Worksheets
-
Gain Access to all AJMaths A Level Further Maths Mock Papers
Edexcel A Level Further Mathematics - Decision 1
Algorithms on Graphs
In this chapter we will learn how we can apply algorithms to graphs and networks to solve many different types of problems.
After watching the AJMaths revision videos on Algorithms on Graphs I will be able to:
- Use Kruskal's Algorithm
- Use Prim's Algorithm
- Apply Prim's Algorithm to a Distance Matrix
- Use Dijkstra's Algorithm
- Use Floyd's Algorithm
- Answer Exam Questions for Algorithms on Graphs for Decision 1
Kruskal's Algorithm
In this video we will take a look at recapping parametric equations from A-Level Maths.
Prim's Algorithm
In this video we will introduce Prim’s algorithm which in a similar fashion to Kruskal’s algorithm will give us a minimum spanning tree for a network.
Applying Prim's Algorithm to a Distance Matrix
In this video we will learn how we can apply Prim’s algorithm to a distance matrix to obtain a minimum spanning tree.
Using Dijkstra's Algorithm
In this video we will introduce Dijkstra’s algorithm!
Floyd's Algorithm
In this video we will introduce Floyd’s algorithm!
Exam Revision for Algorithms on Graphs
In this video we will take a look at answering some exam style questions for Algorithms on Graphs.
Worksheets for Algorithms on Graphs
Still Revising?
Boost your Grades today and become a member!
Click the button below to become a member
