Time complexity of Fleury's Algorithm

algorithm, time-complexity

Solution

Here: http://roticv.rantx.com/book/Eulerianpathandcircuit.pdf you can read among other things, that it is O(E), linear edge count.

Problem

Could you please help me find out the time complexity of the Fleury' algorithm (which is used to get the Eulerian circuit)?

Original source