Difference between revisions of "D1 Route Inspection"
(→Notes) |
(→Supporting activities) |
||
| Line 7: | Line 7: | ||
== Preparation == | == Preparation == | ||
== Supporting activities == | == Supporting activities == | ||
| + | [[File:Route_inspection.pdf]] | ||
| + | |||
== Consolidation == | == Consolidation == | ||
== Homework == | == Homework == | ||
Latest revision as of 09:17, 11 July 2014
Part of D1
Contents
Objectives
- Algorithm for finding the shortest route around a network, travelling along every edge at least once and ending at the start vertex. The network will have up to four odd nodes
Preparation
Supporting activities
Consolidation
Homework
Key questions
Assessment
Notes
Consider all pairings of odd nodes by inspection.
