Vidyalelo
Data Structure · Q725

Miscellaneous on Data Structures

Programming · Data Structure · question 725

Q725

To find an eulerian circuit in the graph by fleury's algorithm, always begin with the vertex having an odd degree.

A.
True
Answer
B.
False

Answer: Option A

Solution

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