Algorithms on graphs

Learn Kruskal's, Prim's, and Dijkstra's algorithms to solve graph problems for your Edexcel IAL Maths D1 exam.

📖Study Guide

In-depth bilingual notes with worked past paper examples.

✍️Practice Exam

Original questions for this topic: MCQ + FRQ + Application + drag/match.

🎴Flashcards

20+ flashcards: definitions / formulas / pitfalls. Click to flip.

📊Exam Insight Coming Soon

How this topic is distributed across past papers — data that shows what matters.

Ready to get confident with this topic?
Choose your course, revise with illustrated notes and concept cards, then find your gaps with quizzes and mock exams.
Choose your course and start learning