Networks & Decision Maths · Learning My Way

New to Networks? Start with Graph Theory Basics to learn the key vocabulary, then work through in order. Already know the foundations? Jump straight to the subtopic you need, each one stands alone.

Graph Foundations

Ready ✓

Graph Theory Basics

Vertices, edges, degree and types of graphs. The vocabulary you need before anything else in this topic makes sense.

vertices & edges degree connected graphs trees: n−1 edges

Study now →

Ready ✓

Euler Paths & Circuits

Can you trace a graph without lifting your pen? Learn the odd/even vertex rule and Euler's formula: v − e + f = 2.

traversability odd vertices Euler's formula v − e + f = 2

Study now →

Optimisation, Trees & Paths

Coming soon

Minimum Spanning Tree

Connect all nodes using the least total weight of edges. Uses Kruskal's algorithm, sort edges, add if no cycle forms, stop at n−1 edges.

Kruskal's algorithm weighted graphs n−1 edges cycles

Lesson coming Term 3

Ready ✓

Shortest Path

Find the minimum-weight route between two points in a network. Uses Dijkstra's algorithm or the inspection method.

Dijkstra's algorithm inspection method box the minimum

Study now →

Scheduling, Project Planning

Coming soon

Critical Path Analysis

Find the minimum time to complete a project. Use a forward pass to work out the Earliest Start Time of each task, take the MAX at any join.

EST forward pass critical path activity networks take the MAX

Lesson coming Term 3

Coming soon

Float Time

How long can a task be delayed without pushing the whole project out? Backward pass to find LST, then Float = LST − EST. Covered in the Critical Path page.

LST backward pass Float = LST − EST slack time non-critical tasks

Lesson coming Term 3

Assignment Problems

Coming soon

Hungarian Algorithm

Assign workers to jobs (or machines to tasks) to minimise total cost or time. A set process: row reduce → column reduce → cover zeros with minimum lines → assign.

row reduction column reduction covering zeros optimal assignment minimisation 3×3 matrix

Lesson coming Term 3

Test Yourself

⚡

Sparky's Workshop, Escape Room

6 challenges covering MST, Critical Path, Float, Hungarian Algorithm, Time Zones and Business Maths. Work through all checkpoints to escape.

Play →

🖥️

Node Zero, Escape Room

The school network has crashed. Diagnose the topology, degree sums, tree edge counts and Euler's planar formula, to restore every server.

Play →

🏙️