Euler rules state to solve the problem that the sum of the number of time each letter has to appear in one more than the total number of bridges the journey is made. But when if the number occurred is greater than 1 more of the bridges a journey cannot be made.
Who was Leon Hard Euler?
Link
Leon Hard Euler (15 April 1707 - 18 September 1783) is Swiss mathematician who discovered many questions on the theories of mathematics,
The theory of the konisberg bridge problem
In the 18th century, the Swiss mathematician Leonhard Euler was intrigued by the question of whether a route that existed would be traveled each of the seven bridges exactly once In demonstrating that the answer is no, he laid the foundation for graph theory.
Leonhards stament
"For a network to have an Euler path, the start and finish nodes must have an odd number of paths connected to them. All other nodes must have an even number of connecting paths.'
"For a network to have an Euler circuit (a path that begins and ends at the same point), all the nodes must have an even number of paths."
"Euler states that if the sum of the number of times each letter must appear is one more then the total number of bridges, a journey can be made. However, if the number of occurrences is greater than one more than the number of bridges, a journey cannot be made, like the Königsberg Bridge problem. This is because the rule, which Euler gives for an odd number of bridges, using his Figure 2, is true for the general situation whether there is only one other landmass or more than one."
The network is traversable when. link
All nodes are even - Start and finish anywhere in the network.
Are two nodes ODD?? - There must be at less 2 odd nodes and more for the network to be transferable and you must always start and finish on the same nodes.
If there are more than two odd nodes - the network is not transferable.
What do you need for a network to be a traversable network?





