The issue that should immediately spring to intellect is this: if a graph is connected and the diploma of every vertex is even, is there an Euler circuit? The solution is Indeed.If you'll find a number of paths between two nodes in the graph, the space in between these nodes could be the length in the shortest route (otherwise, the gap is infinity)