Optimisation in Networks
Application of algorithms such as Dijkstra's and Kruskal's to find shortest paths and minimum spanning trees. Students solve logistical and routing problems.
About This Topic
Application of algorithms such as Dijkstra's and Kruskal's to find shortest paths and minimum spanning trees. Students solve logistical and routing problems.
Key Questions
- How do we find the most efficient route through a network?
- What is a minimum spanning tree?
- How do algorithms help in solving complex logistical problems?
Planning templates for Applied 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 Mathematical Modelling and Networks
The Mathematical Modelling Cycle
An introduction to formulating, solving, interpreting, and evaluating mathematical models. Students learn to make assumptions and define variables for complex problems.
2 methodologies
Graph Theory Fundamentals
Students investigate the properties of graphs, including vertices, edges, degrees, and paths. This forms the foundation for analysing complex networks.
2 methodologies
Critical Path Analysis
Using activity networks to schedule and manage projects efficiently. Students calculate early and late start times to identify the critical path.
2 methodologies