D1 Route Inspection

From KS5 Mathematics
Revision as of 08:58, 18 June 2014 by IDI (talk | contribs) (→‎Notes)
Jump to: navigation, search

Part of D1

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.

Retrieved from ‘http://www.pretenshn.com/mediawiki/index.php?title=D1_Route_Inspection&oldid=630’