Implement the algorithm EulerCircuit.C/C++ following this description: Step 1: Start from any v to find Circuit C Step 2: Delete the edges in C out of G and alone vertices. Step 3: If G=Ø then C is...

Implement the algorithm EulerCircuit.C/C++ following this description:

Step 1: Start from any v to find Circuit C

Step 2: Delete the edges in C out of G and alone vertices.

Step 3: If G=Ø then C is Euler Circuit of G.

Step 4: Find the sharing vertices v of C and G:

- Sort C starting from v.

- Start from v, find Circuit C'.

- Connect C’ into C.

- Return Step 2.