Write a program to implement Fleury's Algorithm.
STEP 1 - Choose a vertex v as the starting vertex for the circuit and choose an edge e with v as one of the end vertices.
STEP 2 - If the other end vertex u of the edge e is also v, go to Step 3. Otherwise, choose an edge e(1) different from e with u as one of the end vertices. If the other vertex u(1) of e(1) is v go to Step 3; otherwise, choose an edge e(2) different from e and e(1) with u(1) as one of the end vertices and repeat Step 2.
Step 3 - If the circuit T(1) obtained in Step 2 contains all the edges, then stop. Otherwise, chooose an edge e(j) different from the edges of T(1) such that one of the end vertices of e(j),say, w is a member of the circuit T(1)
A++ solution for this question
Solution contain C++ program and input data.
Using DevC++ IDE to run program.
If you want run on Visual studio, you can edit some lines in source code (i can help you do it).