**Practice IV: Minimum Cost Spanning Trees**

Prepared by:

Joseph Malkevitch

Department of Mathematics and Computer Studies

York College (CUNY)

Jamaica, New York 11451

email:

__malkevitch@york.cuny.edu__

web page:

__http://york.cuny.edu/~malk/__

For each of the weighted graphs below find a

a. Boruvka

b. Prim (start at vertex 3; repeat starting at vertex 2)

c. Kruskal

minimum cost spanning tree. Number the edges of the tree in the order in which you add them to the tree.

G:

H:

I:

K: