Networks and Paths
Network concepts, drawing network diagrams, Eulerian and Hamiltonian walks, minimal spanning trees, and shortest paths.
Active lessons
7
Status
Active
Lesson flow
Learn -> Guided Practice -> Independent Practice -> Mastery Quiz
How to use this unit
- Start from lesson 1 and move through the pathway in order.
- Use guided practice before attempting independent practice.
- Mastery quizzes check whether the skill is ready for review or extension.
Unit pathway
Lesson pathway
7 of 7 active
Lesson 1
2A Networks
Read networks: vertices, edges, degree, adjacency, and the sum-of-degrees relationship.
Lesson 2
2B Travelling a Network
Paths and circuits through a network, the length of a route, and checking a route is valid.
Lesson 3
2C Drawing a Network Diagram
Represent practical situations as networks: choosing vertices and edges and counting them.
Lesson 4
2D Eulerian and Hamiltonian Walks
Eulerian routes (every edge once) and Hamiltonian routes (every vertex once), with the odd-degree test.
Lesson 5
2E Network Problems
Practical network problems: connectivity, route weights, comparing routes, and reasoning from structure.
Lesson 6
2F Minimal Spanning Trees
Connect all vertices at least total weight with no cycle, and find the minimal spanning tree's weight.
Lesson 7
2G Shortest Path
Find the shortest (least-weight) path between two vertices by comparing route totals.
Part of the Online Learning Package
Unit previews stay public, while individual lessons require active online learning access.