The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x

TEST SERIES [closed]

+2 votes
254 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 by Active (1.4k points)
closed by | 254 views

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
49,831 questions
54,735 answers
189,349 comments
80,096 users