Practice IV: Minimum Cost Spanning Trees
Department of Mathematics and Computer Studies
York College (CUNY)
Jamaica, New York 11451
For each of the weighted graphs below find a
b. Prim (start at vertex 3; repeat starting at vertex 2)
minimum cost spanning tree. Number the edges of the tree in the order in which you add them to the tree.