Consider the given pseudocode for eulerizing a graph. Which of the following best suits the blank?
Pick up all the vertices of _______
Repeat edges between the vertices until the graph has no odd degree
Repeat only pre-existing edges
Pick up all the vertices of _______
Repeat edges between the vertices until the graph has no odd degree
Repeat only pre-existing edgesA. Odd degree
B. Even degree
C. At least one degree
D. At most one degree
Answer: Option A
This Question Belongs to Data Structure >> Miscellaneous On Data Structures
Join The Discussion