A LevelFurther MathsEdexcelDecision 1Algorithms on Graphs

Algorithms on Graphs (Edexcel A Level Further Maths)

Get ready for your Edexcel A Level Further Maths exams with our revision resources. Find everything you need to revise this topic, so you can go into your exam confident and prepared. Teachers and examiners write all our resources, and they’re designed specifically for each exam board. We regularly update them to match the latest syllabus, so you’ll only revise the most accurate, up-to-date information. Explore the collection below to get started.

Minimum Spanning Trees

  1. Networks & Matrices
  2. Kruskal's Algorithm
  3. Prim's Algorithm
  4. Comparing MST Algorithms

Shortest Path Algorithms

  1. Dijkstra's Algorithm
  2. Floyd's Algorithm
  3. Comparing Dijkstra's & Floyd's Algorithms

The Route Inspection Algorithm

  1. Route Inspection
  2. Route Inspection & Repeated Routes

The Travelling Salesman Problem

  1. The Travelling Salesman Problem
  2. Upper & Lower Bounds for the Travelling Salesman Problem
  3. Solving the Travelling Salesman Problem

Minimum Spanning Trees

  1. Exam Questions

Shortest Path Algorithms

  1. Exam Questions

The Route Inspection Algorithm

  1. Exam Questions

The Travelling Salesman Problem

  1. Exam Questions
Edexcel A Level Further Maths Past Papers