By the end of this module, you should:
- understand what is meant by term "greedy"
- understand the definition of a minimum spanning tree for a graph
- understand and be able to perform Prim's MST algorithm
- understand the asymptotic complexity of Prim's algorirhm
- understand the general approach to proving a greedy algorithm correct
- be prepared for the final exam