Difference between revisions of "D1 Networks"
(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> | ||
| − | * | + | *The minimum connector (minimum spanning tree) problem |
| + | *Prim's algorithm (on graph or on matrix) | ||
| + | *Kruskal's algorithm | ||
| + | *Dijkstra's shortest path algorithm | ||
</onlyinclude> | </onlyinclude> | ||
| + | |||
== Preparation == | == Preparation == | ||
== Supporting activities == | == Supporting activities == | ||
Latest revision as of 08:56, 18 June 2014
Part of D1
Contents
Objectives
- The minimum connector (minimum spanning tree) problem
- Prim's algorithm (on graph or on matrix)
- Kruskal's algorithm
- Dijkstra's shortest path algorithm
