1. //Initialise single source(G, s) 2. S=0 3. Q=V[G] 4. While Q != 0 5. Do u=extract-min(Q) 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 o While loop gets executed for v-1 times o While loop gets executed only once While loop does not get executed Do not forget to click on submit Submit You have used 0 of 1 attempt Save