Understand weighted networks and the shortest-path problem.
Key knowledgeUnderstand weighted networks and the shortest-path problem.
Build the idea
A shortest-path problem minimises the sum of weights along a route between specified vertices. It differs from connecting every vertex at minimum total construction cost. Read direction restrictions before adding weights, and include units in the final interpretation. For a small network, comparing plausible complete routes can justify a shortest-path result by inspection.
Try the sample task
An undirected road network has AB=4, AC=2, BC=1, BD=5, CD=7, CE=3 and ED=1 kilometres. Find a shortest A-to-D route and justify it by comparing alternatives.
The full worksheet includes the worked solution and remaining task set.
What this activity covers
This focused activity develops the stated idea through one context. It is practice, not evidence that every application or subclause of a broad study-design bullet has been mastered.