THE BEST SIDE OF CIRCUIT WALK

In Eulerian path, every time we stop by a vertex v, we walk as a result of two unvisited edges with one stop level as v. For that reason, all middle vertices in Eulerian Route must have even degree. For Eulerian Cycle, any vertex may be middle vertex, as a result all vertices have to have even diploma.How to define Shortest Paths from Resource to a