greedy - 12 Lin / Devi Comp 122, Fall 2003 Minimum Spanning Trees Given: Connected, undirected, weighted graph, G Find: Minimum - weight spanning tree, T Example: bc a def a bc fed Acyclic subset of edges(E) that connects all vertices of G.
{}