Given below is the pseudocode of the vertex cover problem. Which of the following best suits the blank?
Vertex_Cover(G = (V, E))
{
A = { }
while (E!=0)
{
pick any edge (u, v) from E
add u and v to A
________________
}
return A
}
Vertex_Cover(G = (V, E))
{
A = { }
while (E!=0)
{
pick any edge (u, v) from E
add u and v to A
________________
}
return A
}A. remove every edge incident on either u or v
B. add every edge incident on u
C. delete the vertex
D. delete adjacent edge
Answer: Option A
This Question Belongs to Data Structure >> Miscellaneous On Data Structures
Join The Discussion