Vidyalelo
Data Structure · Q852

Miscellaneous on Data Structures

Programming · Data Structure · question 852

Q852

To find an eulerian cycle by fleury's algorithm, from which vertex you should start if the graph has no odd vertices?

A.
Vertex with degree 1
B.
Any vertex of the graph
Answer
C.
Vertex with the highest degree
D.
Vertex with the lowest degree

Answer: Option B

Solution

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