Back when we were looking at the Seven Bridges of
Königsberg Problem, we wanted a circuit that used
every edge. Now let’s see is we can find a circuit that
visits every node once.
1
2
3
4
5
6
7
