Shortest paths and spanning trees
Students apply algorithms to find the shortest path between two nodes in a weighted graph. They determine the minimum spanning tree to optimise network connections, such as laying cables or pipes.
About This Topic
Students apply algorithms to find the shortest path between two nodes in a weighted graph. They determine the minimum spanning tree to optimise network connections, such as laying cables or pipes.
Key Questions
- How do we find the most efficient route between two points?
- What is a minimum spanning tree?
- How does Prim's algorithm help us solve optimisation problems?
Active Learning Ideas
See all activities→Activities & Teaching Strategies
See all activities
Planning templates for General Mathematics
5E Model
The 5E Model structures lessons through five phases (Engage, Explore, Explain, Elaborate, and Evaluate), guiding students from curiosity to deep understanding through inquiry-based learning.
Unit PlannerMath Unit
Plan a multi-week math unit with conceptual coherence: from building number sense and procedural fluency to applying skills in context and developing mathematical reasoning across a connected sequence of lessons.
RubricMath Rubric
Build a math rubric that assesses problem-solving, mathematical reasoning, and communication alongside procedural accuracy, giving students feedback on how they think, not just whether they got the right answer.
More in Graphs and Networks
Introduction to graphs and networks
Students learn the fundamental terminology of graph theory, including vertices, edges, degrees, and paths. They construct graphs to represent practical situations such as social networks and transport routes.
8 methodologies
Project planning and critical path analysis
Students use directed graphs to schedule and manage complex projects. They perform forward and backward scanning to identify the critical path and calculate float times for activities.
8 methodologies