search
Log In

TEST SERIES [closed]

2 votes
362 views

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 with the note: Already answered here : https://gateoverflow.in/170983/prims-algorithm?show=170983#q170983
in Algorithms
closed by
362 views

Related questions

5 votes
1 answer
4
670 views
Given graph using Prim’s or Kruskal’s algorithm, find out that how many distinct minimum cost spanning trees are possible___? My answer was 1 and given is 2 ,what I am missing ? Edit:I had confirmed with it and answer is only one tree possible.
asked Jan 2, 2018 in Algorithms sunil sarode 670 views
...