Network Concepts
Network Diagrams and Shortest Paths
HSC Mathematics Standard 2 topic guide
Networks is a core part of HSC Mathematics Standard 2. This guide connects the syllabus ideas behind Network Concepts, Critical Path Analysis, Network Flow, shows how they appear in worked problems, and points you to the formulas and full lessons needed for exam revision.
What you will learn
The units below follow the structure used in the full Study to Learn course. Use the outline to identify exactly which idea needs attention, then work through the public example before continuing to the complete lesson path.
Network Diagrams and Shortest Paths
Activity Charts, Float Time and the Critical Path
Flow Networks & Terminology · Maximum Flow & Minimum Cut
Free worked preview
This complete preview comes from the Network Concepts unit. It introduces the core language, shows the method in context, and gives you a real example of the lesson quality before you create an account.
A network consists of vertices connected by edges, often weighted (distance, time, or cost).
Degree: number of edges at a vertex. Path: a route along edges. Minimum spanning tree: the set of edges connecting all vertices with the smallest possible total weight, with no cycles.
Reviewed by the Study to Learn editorial team · Updated 2026-07-24