Professional Documents
Culture Documents
NETWORK PUZZLE
Leonhard Euler
The Seven Bridges of Königsberg
• Can you take a walk through the town, visiting each
part of the town and crossing each bridge only
once?
“Is it possible to draw a given picture without lifting pencil from
the paper and without tracing any of the edges more than once?”
You should:
Draw all the lines, but never go over any line
more than once, and don't remove your pencil
from the paper.
Can you draw this?
Or something like this?
Can you draw this?
EULERIAN PATH
Eulerian path (or Eulerian trail) is a path in a
graph that visits every edge exactly once
EULERIAN CIRCUIT
Eulerian Circuit is an Eulerian Path which starts
and ends on the same vertex.
So, How Can We Know Which Ones Work and Which Ones Do Not?
Do you notice a
pattern?
IT IS AN EULER PATH …
• If two vertices have odd degree and all other
vertices have even degree.
IT IS AN EULER CIRCUIT …
• If all vertices have even degree.
Now Back to the Königsberg Bridge Question
Vertices A, B and D have
degree 3 and vertex C has
degree 5, so this graph has
four vertices of odd degree.
So it does not have an Euler
Path.