Examveda

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

B. delete the edge

C. delete both the vertex connected to it

D. contract the connected vertices

Answer: Option A


This Question Belongs to Data Structure >> Miscellaneous On Data Structures

Join The Discussion

Related Questions on Miscellaneous on Data Structures