15-122 Principles of Imperative Computation
Lecture 24: Spanning Trees

• Reading: 24-spanning.pdf
• Code: none
• Concepts:
  • Undefined behavior on overflow for signed arithmetic in C
  • Defined behavior on overflow for unsigned arithmetic in C
  • Undirected graphs
  • Definitions of (undirected) trees
  • Spanning trees
  • Creating a random maze
  • Weighted graphs
  • Minimum spanning trees (MSTs)
  • Cycle property
  • Spanning forest
  • Kruskal's algorithm
• Previous lecture: Dynamic Programming
• Next lecture: Engineering Better Software at Microsoft

[ Home | Schedule | Assignments | Resources ]
[ Blackboard | academic.cs.15-122 ]

fp@cs
Frank Pfenning