Given the graph below, is it possible to construct a path (or a cycle, i.e. a path starting and ending on the same vertex) which visits each edge exactly once ?
The first thing that Euler did was boil the Konigsberg problem down to its essentials by stripping away all irrelevant material:
- the shapes and sizes of the land masses don't matter - turn them into points
- all that matters about the bridges is how they connect the land masses - make them into lines connecting the points
- having done that, it is not necessary to actually depict the river to study the problem - leave it out