D1 Networks

From KS5 Mathematics
Revision as of 08:56, 18 June 2014 by IDI (talk | contribs) (→‎Objectives)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to: navigation, search

Part of D1

Objectives

  • The minimum connector (minimum spanning tree) problem
  • Prim's algorithm (on graph or on matrix)
  • Kruskal's algorithm
  • Dijkstra's shortest path algorithm


Preparation

Supporting activities

Consolidation

Homework

Key questions

Assessment

Notes

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