Euler Tour Example 0 Adjacency list 0 1

Euler Tour: Example 0 Adjacency list 0: 1: 2: 3: 4: 5: 6: 1 0 0 4 6 4 4 2 5 6 2 3 4 1 2 5 3 2 0 0 1 2 3 6 4 5 1

Euler Tour: Example 0 Adjacency list 0: 1: 2: 3: 4: 5: 6: 1 0 0 4 6 4 4 2 5 6 2 3 4 1 2 5 3 2 0 0 1 2 3 6 4 stack 5 0 stdout 2

Euler Tour: Example 0 Adjacency list 0: 1: 2: 3: 4: 5: 6: 1 X 0 4 6 4 4 2 5 6 2 3 4 1 2 5 3 2 0 0 1 2 3 5 6 4 stack 1 0 stdout 3

Euler Tour: Example 0 Adjacency list 0: 1: 2: 3: 4: 5: 6: 1 X 0 4 6 4 4 2 5 6 2 X 3 4 X 1 2 5 3 2 0 0 1 2 6 stack 3 4 2 5 1 0 stdout 4

Euler Tour: Example 0 Adjacency list 0: 1: 2: 3: 4: 5: 6: 1 X 0 X 4 6 4 4 2 5 6 X 2 X 3 4 X 1 2 5 3 2 0 0 1 2 3 6 4 stack 0 2 5 1 0 stdout 5

Euler Tour: Example 0 Adjacency list 0: 1: 2: 3: 4: 5: 6: 1 X 0 X 4 6 4 4 2 X 5 6 X 2 X 3 4 X 1 2 5 3 2 0 X 0 stack 1 2 6 5 3 4 0 2 5 1 0 stdout 6

Euler Tour: Example 0 stack Adjacency list 0: 1: 2: 3: 4: 5: 6: 1 X 0 X 4 6 4 X 4 2 X 5 6 X 2 X 3 4 X 1 2 5 3 2 X 0 1 2 6 4 5 3 4 0 2 5 1 0 stdout 7

Euler Tour: Example 0 stack Adjacency list 0: 1: 2: 3: 4: 5: 6: 1 X 0 X 4 6 X 4 X 2 X 5 6 X 2 X 3 4 X 1 2 5 3 2 X 0 1 2 6 6 4 5 3 4 0 2 5 1 0 stdout 8

Euler Tour: Example stack 0 Adjacency list 0: 1: 2: 3: 4: 5: 6: 1 X 0 X 4 6 X 4 X 2 X 5 X 6 X 2 X 3 4 X 1 2 5 3 2 X 0 X 0 1 2 6 6 4 5 3 4 0 2 5 1 0 stdout 9

Euler Tour: Example 0 stack Adjacency list 0: 1: 2: 3: 4: 5: 6: 1 X 0 X 4 6 X 4 X 2 X 5 X 6 X 2 X 3 4 X 1 2 5 3 2 X 0 X 1 2 6 6 4 5 3 4 0 2 5 1 0 stdout 0 10

Euler Tour: Example 0 stack Adjacency list 0: 1: 2: 3: 4: 5: 6: 1 X 0 X 4 6 X 4 X 2 X 5 X 6 X 2 X 3 4 X 1 2 5 3 2 X 0 X 1 2 6 4 5 3 4 0 2 5 1 0 stdout 0 6 11

Euler Tour: Example 0 stack Adjacency list 0: 1: 2: 3: 4: 5: 6: 1 X 0 X 4 X 6 X 4 X 2 X 5 X 6 X 2 X 3 4 X 1 2 5 X 3 2 X 0 X 1 2 6 3 4 5 3 4 0 2 5 1 0 stdout 0 6 12

Euler Tour: Example stack 0 Adjacency list 0: 1: 2: 3: 4: 5: 6: 1 X 0 X 4 X 6 X 4 X 2 X 5 X 6 X 2 X 3 4 X 1 X 2 X 5 X 3 2 X 0 X 2 1 2 6 3 4 5 3 4 0 2 5 1 0 stdout 0 6 13

Euler Tour: Example stack 0 4 Adjacency list 0: 1: 2: 3: 4: 5: 6: 1 X 0 X 4 X 6 X 4 X 2 X 5 X 6 X 2 X 3 X 4 X 1 X 2 X 5 X 3 X 2 X 0 X 2 1 2 6 3 4 5 3 4 0 2 5 1 0 stdout 0 6 14

Euler Tour: Example stack 0 Adjacency list 0: 1: 2: 3: 4: 5: 6: 1 X 0 X 4 X 6 X 4 X 2 X 5 X 6 X 2 X 3 X 4 X 1 X 2 X 5 X 3 X 2 X 0 X 2 1 2 6 3 4 5 3 4 0 2 5 1 0 stdout 0 6 4 15

Euler Tour: Example 0 stack Adjacency list 0: 1: 2: 3: 4: 5: 6: 1 X 0 X 4 X 6 X 4 X 2 X 5 X 6 X 2 X 3 X 4 X 1 X 2 X 5 X 3 X 2 X 0 X 1 2 6 3 4 5 3 4 0 2 5 1 0 stdout 0 6 4 2 16

Euler Tour: Example 0 stack Adjacency list 0: 1: 2: 3: 4: 5: 6: 1 X 0 X 4 X 6 X 4 X 2 X 5 X 6 X 2 X 3 X 4 X 1 X 2 X 5 X 3 X 2 X 0 X 1 2 6 4 5 3 4 0 2 5 1 0 stdout 0 6 4 2 3 17

Euler Tour: Example 0 Adjacency list 0: 1: 2: 3: 4: 5: 6: 1 X 0 X 4 X 6 X 4 X 2 X 5 X 6 X 2 X 3 X 4 X 1 X 2 X 5 X 3 X 2 X 0 X 1 2 6 stack 5 3 4 0 2 5 1 0 stdout 0 6 4 2 3 4 18

Euler Tour: Example 0 Adjacency list 0: 1: 2: 3: 4: 5: 6: 1 X 0 X 4 X 6 X 4 X 2 X 5 X 6 X 2 X 3 X 4 X 1 X 2 X 5 X 3 X 2 X 0 X 1 2 3 6 4 stack 0 2 5 1 0 stdout 0 6 4 2 3 4 5 19

Euler Tour: Example 0 Adjacency list 0: 1: 2: 3: 4: 5: 6: 1 X 0 X 4 X 6 X 4 X 2 X 5 X 6 X 2 X 3 X 4 X 1 X 2 X 5 X 3 X 2 X 0 X 1 2 6 stack 3 4 2 5 1 0 stdout 0 6 4 2 3 4 5 0 20

Euler Tour: Example 0 Adjacency list 0: 1: 2: 3: 4: 5: 6: 1 X 0 X 4 X 6 X 4 X 2 X 5 X 6 X 2 X 3 X 4 X 1 X 2 X 5 X 3 X 2 X 0 X 1 2 3 5 6 4 stack 1 0 stdout 0 6 4 2 3 4 5 0 2 21

Euler Tour: Example 0 Adjacency list 0: 1: 2: 3: 4: 5: 6: 1 X 0 X 4 X 6 X 4 X 2 X 5 X 6 X 2 X 3 X 4 X 1 X 2 X 5 X 3 X 2 X 0 X 1 2 3 6 4 stack 5 0 stdout 0 6 4 2 3 4 5 0 2 1 22

Euler Tour: Example 0 Adjacency list 0: 1: 2: 3: 4: 5: 6: 1 X 0 X 4 X 6 X 4 X 2 X 5 X 6 X 2 X 3 X 4 X 1 X 2 X 5 X 3 X 2 X 0 X 1 2 3 6 4 5 stdout 0 6 4 2 3 4 5 0 2 1 0 23