Difference between revisions of "D1 Route Inspection"
(Created page with "Part of D1 == Objectives == <onlyinclude> * </onlyinclude> == Preparation == == Supporting activities == == Consolidation == == Homework == == Key questions == == Assessme...") |
(→Objectives) |
||
| Line 2: | Line 2: | ||
== Objectives == | == Objectives == | ||
<onlyinclude> | <onlyinclude> | ||
| − | * | + | *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 |
</onlyinclude> | </onlyinclude> | ||
| + | |||
== Preparation == | == Preparation == | ||
== Supporting activities == | == Supporting activities == | ||
Revision as of 08:57, 18 June 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
