2 votes

Consider the following graph and Assume node ‘P’ as the starting vertex for Prim’s algorithm. Which of the following can be the correct order of edges to which they are added to construct Minimum Spanning Tree (MST)?

- P-Q, Q-R, R-W, R-S, V-X, V-U, W-V, S-T
- P-Q, Q-R, R-W, W-V, V-X, V-U, R-S, S-T
- P-Q, P-X, X-V, V-U, U-R, R-S, R-W, S-T
- P-Q, P-X, X-V, V-U, U-R, R-W, R-S, S-T

PLEASE EXPLAIN.

closed with the note:
Already answered here : https://gateoverflow.in/170983/prims-algorithm?show=170983#q170983