Fleury's algorithm: Find Euler or Eulerian tour in a graph

Fleury's algorithm is a simple algorithm for finding Eulerian paths or tours. It proceeds by repeatedly removing edges from the graph in such way, that the graph remains Eulerian.

The average case time complexity is O((V+E)^2) and the auxiliary space complexity is O(V^2)

Refer the article for more details and implementations.

Share your thoughts or ask any questions below.
This is a companion discussion topic for the original entry at http://iq.opengenus.org/fleury-algorithm-finding-eulerian-tours-in-a-graph/