Vidyalelo
Data Structure · Q518

Miscellaneous on Data Structures

Programming · Data Structure · question 518

Q518

Consider the following algorithm of Karger's algorithm given below. Which of the following best suits the blank? Let G=(V, E) while (V > 2) pick any edge e from E randomly __________________________ remove self-loops return the cut left with last 2 vertices

A.
merge or contract both vertices in a single vertex
Answer
B.
delete the edge
C.
delete both the vertex connected to it
D.
contract the connected vertices

Answer: Option A

Solution

Answer: Option A
No explanation is given for this question Let's Discuss on Board