Question: 1. //Initialise single source (G, S) 2. S=0 3. Q=V [G] 4. While Q != 0 5. Do u=extract-min (2) 6. S=S union {u} 7.

 1. //Initialise single source (G, S) 2. S=0 3. Q=V [G]

1. //Initialise single source (G, S) 2. S=0 3. Q=V [G] 4. While Q != 0 5. Do u=extract-min (2) 6. S=S union {u} 7. For each vertex v in adj [u] 8. Do relax (u, v, w) 3. What happens when while loop in line 4 is changed to while Q>1? There can be several Minimum costs of spanning tree in one graph While loop gets executed for v-1 While loop gets executed only once While loop does not get executed

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!