Lesson 2: Types of graphs and network diagrams
Drawing a network of walking tracks
SkillsDrawing network diagramsTypes of graphs
Worked example
The table lists the walking tracks in a national park and their lengths.
| Track between | Length (km) |
|---|---|
| Ranger station and Lookout | 2.5 |
| Ranger station and Waterfall | 4.0 |
| Ranger station and Creek camp | 3.5 |
| Lookout and Waterfall | 2.0 |
| Waterfall and Creek camp | 3.0 |
| Waterfall and Bush camp | 4.5 |
| Creek camp and Bush camp | 2.5 |
(a) Construct a network diagram to represent the tracks.
(b) Which place has the highest degree, and what does that degree tell a walker?
(c) What is the total length of the tracks?
Step 1: Choose the vertices
One vertex for each place — Ranger station, Lookout, Waterfall, Creek camp and Bush camp. Spread them out so the edges will not crowd each other.
Step 2: Draw one edge for each track
The seven rows give seven edges. Write each length on its edge, which makes the diagram a weighted graph, or network.
The tracks can be walked in either direction, so the edges have no arrows.
Step 3: Check the diagram
Degrees: Ranger station 3, Lookout 2, Waterfall 4, Creek camp 3, Bush camp 2. The total is . ✓
If the degree total is not twice the number of rows, an edge has been missed or drawn twice.
Step 4: Read off the highest degree
The Waterfall has degree 4. Four tracks meet there, so from the Waterfall a walker can set off in four directions.
Step 5: Add the weights
km
Answer
(a) Five vertices, one for each place, joined by seven edges, one for each track, each labelled with its length. (b) The Waterfall, with degree 4: four tracks meet there. (c) 22 km.
Try a similar one
A fresh question of the same kind, checked as you answer, with hints and a full solution.
Method
One vertex for each place, person or intersection.
One edge for each connection: arrows only if the connection is one-way, and weights if a number is attached.
Check: the degree total is twice the number of connections.
Watch out for
Leaving the weights off, which throws away the information the network is for.