In Eulerian path, every time we stop by a vertex v, we walk through two unvisited edges with one finish level as v. As a result, all middle vertices in Eulerian Route need to have even diploma. For Eulerian Cycle, any vertex might be middle vertex, as a result all https://steveq395mnn1.bloggactif.com/profile