A scenario wherein Leonhard Euler wanted to see if it was possible to walk a route that crosses all seven bridges on the river of Konigsberg.
- He solved problem by representing land as nodes and bridges as edges
- He proved that a walk that traverses each edge exactly once and returns to the starting point (Graph Cycle) can exist if each node has an even number of edges leaving it