The seven bridges of Königsberg is a historically notable problem in mathematics. Its negative resolution by Leonhard Euler in 1736 laid the foundations of graph theory and prefigured the idea of topology. (Topology concern with the properties of geometry like continuous deformations, stretching, twisting, crumpling and bending).
But what is the Königsberg problem?
The Königsberg bridge problem was to find the possibility of finding a path over every one of seven bridges that span a river flowing past an island but without crossing the bridges twice.
How to work out if a network is transferable?
Node: a point in a network or diagram at which lines or pathways intersect or branch.
Network: an arrangement of intersecting horizontal and vertical lines.
Solution to the problem?
A network is only transferable when there are 2 odd nodes or no odd nodes. If all nodes are even then you can start and finish anywhere.
