Q626
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
A.
Odd degree
AnswerB.
Even degree
C.
At least one degree
D.
At most one degree
Answer: Option A
Solution
Answer: Option A
No explanation is given for this question Let's Discuss on Board