closed by
1,246 views
2 votes
2 votes
closed with the note: Already answered here : https://gateoverflow.in/170983/prims-algorithm?show=170983#q170983

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)?
image:n104.PNG

  1.    P-Q, Q-R, R-W, R-S, V-X, V-U, W-V, S-T
  2.    P-Q, Q-R, R-W, W-V, V-X, V-U, R-S, S-T
  3.    P-Q, P-X, X-V, V-U, U-R, R-S, R-W, S-T
  4.   P-Q, P-X, X-V, V-U, U-R, R-W, R-S, S-T

PLEASE EXPLAIN.

closed by

Related questions

0 votes
0 votes
3 answers
1
2 votes
2 votes
2 answers
2
Psy Duck asked Jun 24, 2023
908 views
Can anyone help in solving the question 105 to 109.I don't have answer key I want to confirm my answer ...i will update my answer in the comments.
5 votes
5 votes
1 answer
4