
Computer Science 226
Algorithms and Data Structures
Spring 2013


Course Information 
Assignments 
Exercises 
Lectures 
Exams 
Precepts 
Booksite
Minimum Spanning Tree
Things to Know Before Lecture
 Know the Basic Concepts and Definitions.
 Definition of an Edge Weighted Undirected Graph.
 API for Edge class (either, other, compareTo).
 Definition of a minimum spanning tree.
 Definition of a cut (there are 2^(V1)1 cuts).
 Understand how to manually carry out the steps of the two basic MST finding algorithms.
 Kruskal's algorithm (repeatedly add smallest edge weight from the whole graph).
 Prim's algorithm (repeatedly add smallest edge weight from the MSTunderconstruction).
It's not necessary to know why the two MST algorithms work, since we'll be going through this during class. You should arrive knowing how the algorithms work. Nor is it necessary to know how to implement Kruskal's algorithm and Prim's algorithm such that you can actually run them on a computer (just being able to do them by hand with pencil and paper is good enough).
PreLecture Preparation Guide.
High priority videos are in red. Medium priority videos are in green. Low priority videos are in blue.
Checkpoint 1: Make sure you can follow all 3 demos.
Checkpoint 2: Complete the Blackboard exercises (they're quite easy).