What you need to know
Check yourself against these “I can” statements.
- I can find a minimum spanning tree with Kruskal's algorithm
- I can find a minimum spanning tree with Prim's algorithm, including from a matrix
- I can use Dijkstra's algorithm to find the shortest path between two vertices
These are the pages for Algorithms on graphs in the International A Level scheme of work, following Pearson Edexcel International Advanced Level Mathematics, Further Mathematics and Pure Mathematics (2018). Open this topic in Mr Wells Maths to see it alongside the rest of the course.