Graph algorithms: BFS, DFS, Prim's algorithm, Kruskal's algorithm - Cambridge IGCSE & A-Level 9618 |

Graph algorithms: BFS, DFS, Prim’s algorithm, Kruskal’s algorithm - | Cambridge IGCSE, AS/ A Level | PPT + Worksheets + Activity + MCQ Quiz + Answer Marking Scheme.

Topic Include:

Graph algorithms: BFS, DFS, Prim’s algorithm, Kruskal’s algorithm
Minimum spanning trees with worked examples

Also suitable for AQA GCSE Computer Science, OCR GCSE Computer Science, Edexcel Computer Science and A-Level Computer Science teachers.

Save hours of lesson planning with this fully resourced, exam-aligned lesson pack on Graph algorithms: BFS, DFS, Prim’s algorithm

What’s included:
• PowerPoint presentationstep-by-step explanations with diagrams and animations
• Student worksheet with Graph algorithms: BFS, DFS, Prim’s algorithm structured questions
• Classroom activity [individual / pair / group] task
• Graph algorithms: BFS, DFS, Prim’s algorithm-question MCQ quiz with answer key
• Full marking scheme with examiner tips

Suggested lesson time: [60 / 90] minutes
All worksheets are print-ready
Fully editable resources.

Great for: classroom teaching, revision lessons, flipped learning, homework tasks.

If you found this useful, please leave a review. it really helps!

Check out my other resources and bundles in my TES shop.