I am currently learning an algorithm called "Fleury". I dont know how to do it nor do I understand it. Can someone explain?

Question

I've done the first step which is start at an odd vertex if there are 2. But, the recursive call is confusing. Ive seen Ace's post so obviously don't send me a code(I'll figure it out someday). Can someone just give me a clue?

Answer 1

Forgot to explain. Fleury's algorithm is suppose to find a way to use all edges in a graph. You save the path or cycle in a stack.