The Gateway to Computer Science Excellence

+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

- All categories
- General Aptitude 1.9k
- Engineering Mathematics 7.5k
- Digital Logic 2.9k
- Programming and DS 4.9k
- Algorithms 4.4k
- Theory of Computation 6.2k
- Compiler Design 2.1k
- Databases 4.1k
- CO and Architecture 3.4k
- Computer Networks 4.2k
- Non GATE 1.4k
- Others 1.4k
- Admissions 595
- Exam Queries 573
- Tier 1 Placement Questions 23
- Job Queries 72
- Projects 18

50,741 questions

57,229 answers

197,978 comments

104,568 users