Search for question
Question

4. (10 points) Find a minimum-weighted spanning tree in the following graph by using (1) Greedy algorithm, and (2) Prim's algorithm, starting at a.

Fig: 1

Fig: 2

Fig: 3