Traverse each bridge do not recross any bridge return to the starting point Euler circuit: return to the starting point by traveling each edge of the...

Traverse each bridge do not recross any bridge return to the starting point Euler circuit: return to the starting point by traveling each edge of the graph once and only once. The distance between two nodes is defined as the number of edges along the shortest path connecting them. If the two nodes are disconnected, the distance is infinity. Is there a solution to the Konigsberg bridge walking problem?