Euler Path and Tour
Euler path problem:
- find a path connecting two vertices v,w in graph G
- such that the path includes each edge exactly once
Note: the path does not have to be simple ⇒ can visit vertices more than once)
If v = w, the we have a Euler tour.
![[Diagram:Pics/graphs/euler-path-tour.png]](Pics/graphs/euler-path-tour.png)
|
![[prev]](icon/prev.gif){kind=icon}
![[index]](icon/up.gif){kind=icon}
![[next]](icon/next.gif){kind=icon}