Question

Find the minimum spanning tree for the following graph using Prim's Algorithm. Start with u = 1 as Entry Point. 4 1 1 1 3 2 11 5 7 6 5 3 1) Show the 1st step, where is u? 2) Show the 2nd step, where is u? 3) Show the final Graph; what is the total weight?

          Find the minimum spanning tree for the following graph using Prim's Algorithm.
Start with u = 1 as Entry Point.
4
1
1
1
3
2
11
5
7
6
5
3
1) Show the 1st step, where is u?
2) Show the 2nd step, where is u?
3) Show the final Graph; what is the total weight?

Find the minimum spanning tree for the following graph using Prim's Algorithm.
Start with u = 1 as Entry Point.
4
1
1
1
3
2
11
5
7
6
5
3
1) Show the 1st step, where is u?
2) Show the 2nd step, where is u?
3) Show the final Graph; what is the total weight?

Added by Nicol-S J.

Computer Science and Information Technology

Trishna Knowledge Systems 2018 Edition

Instant Answer

Solved by Expert Neel Patel

Step 1

We mark u as visited and add it to the minimum spanning tree. The graph now looks like this: 0 [3] 11 [5 1] ^ u 2) Show more…

Show all steps

Thanks for your feedback!

Find the minimum spanning tree for the following graph using Prim's Algorithm Start with u = 1 as Entry Point. 0 [3] 11 [5 1) Show the 1st step, where is u? 2) Show the 2nd step, where is u? 3) Show the final Graph: what is the total weight?