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]](https://dsd5zvtm8ll6.cloudfront.net/si.experts.images/questions/2024/09/66f91d1c23ec0_94766f91d1baf4d2.jpg)
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
Get step-by-step solutions from verified subject matter experts
