Spanning trees and minimum spanning tree algorithms
This module introduces spanning trees and the two standard algorithms for finding minimum spanning trees (MSTs) used in IB AI HL. You will learn how to ap…
📖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.
Stuck on a specific question?
Snap a photo or paste your problem — Ollie (our AI tutor) walks through it step-by-step with diagrams.
Try Ollie free →
Snap a photo or paste your problem — Ollie (our AI tutor) walks through it step-by-step with diagrams.
Try Ollie free →