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 apply both Kruskal's and Prim's algorithms to solve network optimization problems.

📖Study Guide

In-depth bilingual notes with worked past paper examples.

✍️Practice Exam

Timed practice questions with mark scheme grading. Coming soon.

🎴Flashcards

Spaced repetition for key concepts and definitions. Coming soon.

📊Visualizer Coming Soon

Interactive plots and diagrams to build intuition. Coming soon.

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 →