Chapter 7: The Mathematics of Networks: The Cost of Being Connected
A successful student can...
- Identify and use a graph to model minimum network problems.
- Classify which graphs are trees.
- Implement Kruskal's algorithm to find a minimal spanning tree.
- Understand Torricelli's construction for finding a Steiner point.
- Recognize when the shortest network connecting three points uses a Steiner point.
- Understand basic properties of the shortest network connecting a set of (more than three) points.
