Minimum Spanning Trees
Spanning tree of G -- subgraph of G that has same set of vertices as G and is a tree.
MST of weighted graph G -- spanning tree of G whose edges sum to minimum weight
greedy algorithms give optimal solution
Previous slide
Next slide
Back to first slide
View graphic version