We only got through the API's for weighted graphs and edges, and
introduced the MST problem (i.e. through about page 17 in the slides).
So we still need to argue for the correctness of the greedy algorithm,
and to look at its two speicializations (Kruskal and Prim).