230 likes | 378 Vues
Euler Tour: Example. 0. Adjacency list. 0: 1 2 5 6 1: 0 2 2: 0 3 4 1 3: 4 2 4: 6 5 3 2 5: 4 0 6: 4 0. 1. 2. 6. 3. 4. 5. stdout. stack. Euler Tour: Example. 0. Adjacency list. 0: 1 2 5 6 1: 0 2 2: 0 3 4 1 3: 4 2 4: 6 5 3 2 5: 4 0 6: 4 0. 1. 2. 6. 3. 4. 5. 0.
E N D
Euler Tour: Example 0 Adjacency list 0: 1 2 5 61: 0 22: 0 3 4 13: 4 24: 6 5 3 25: 4 06: 4 0 1 2 6 3 4 5
stdout stack Euler Tour: Example 0 Adjacency list 0: 1 2 5 61: 0 22: 0 3 4 13: 4 24: 6 5 3 25: 4 06: 4 0 1 2 6 3 4 5 0
stdout stack Euler Tour: Example 0 Adjacency list 0: 1 2 5 61: 0 22: 0 3 4 13: 4 24: 6 5 3 25: 4 06: 4 0 X 1 2 6 X 3 4 1 5 0
stdout stack Euler Tour: Example 0 Adjacency list 0: 1 2 5 61: 0 22: 0 3 4 13: 4 24: 6 5 3 25: 4 06: 4 0 X 1 2 6 X X X 3 4 2 1 5 0
stdout stack Euler Tour: Example 0 Adjacency list 0: 1 2 5 61: 0 22: 0 3 4 13: 4 24: 6 5 3 25: 4 06: 4 0 X X 1 2 6 X X X X 0 3 4 2 1 5 0
stdout stack Euler Tour: Example 0 Adjacency list 0: 1 2 5 61: 0 22: 0 3 4 13: 4 24: 6 5 3 25: 4 06: 4 0 X X X 1 2 6 X X X X 5 0 3 4 X 2 1 5 0
stdout stack Euler Tour: Example 0 Adjacency list 0: 1 2 5 61: 0 22: 0 3 4 13: 4 24: 6 5 3 25: 4 06: 4 0 X X X 1 2 6 X X 4 X X 5 0 3 4 X X X 2 1 5 0
stdout stack Euler Tour: Example 0 Adjacency list 6 0: 1 2 5 61: 0 22: 0 3 4 13: 4 24: 6 5 3 25: 4 06: 4 0 X X X 1 2 6 X X 4 X X 5 0 3 4 X X X X 2 X 1 5 0
stdout stack Euler Tour: Example 0 Adjacency list 0 6 0: 1 2 5 61: 0 22: 0 3 4 13: 4 24: 6 5 3 25: 4 06: 4 0 X X X X 1 2 6 X X 4 X X 5 0 3 4 X X X X 2 X X 1 5 0
stdout 0 stack Euler Tour: Example 0 Adjacency list 6 0: 1 2 5 61: 0 22: 0 3 4 13: 4 24: 6 5 3 25: 4 06: 4 0 X X X X 1 2 6 X X 4 X X 5 0 3 4 X X X X 2 X X 1 5 0
stdout 0 6 stack Euler Tour: Example 0 Adjacency list 0: 1 2 5 61: 0 22: 0 3 4 13: 4 24: 6 5 3 25: 4 06: 4 0 X X X X 1 2 6 X X 4 X X 5 0 3 4 X X X X 2 X X 1 5 0
stdout 0 6 stack Euler Tour: Example 0 Adjacency list 3 0: 1 2 5 61: 0 22: 0 3 4 13: 4 24: 6 5 3 25: 4 06: 4 0 X X X X 1 2 6 X X 4 X X 5 X 0 3 4 X X X X X 2 X X 1 5 0
stdout 0 6 stack Euler Tour: Example 0 Adjacency list 2 3 0: 1 2 5 61: 0 22: 0 3 4 13: 4 24: 6 5 3 25: 4 06: 4 0 X X X X 1 2 6 X X 4 X X X 5 X X 0 3 4 X X X X X 2 X X 1 5 0
stdout 0 6 stack Euler Tour: Example 0 4 Adjacency list 2 3 0: 1 2 5 61: 0 22: 0 3 4 13: 4 24: 6 5 3 25: 4 06: 4 0 X X X X 1 2 6 X X 4 X X X X 5 X X 0 X 3 4 X X X X X 2 X X 1 5 0
stdout 0 6 4 stack Euler Tour: Example 0 Adjacency list 2 3 0: 1 2 5 61: 0 22: 0 3 4 13: 4 24: 6 5 3 25: 4 06: 4 0 X X X X 1 2 6 X X 4 X X X X 5 X X 0 X 3 4 X X X X X 2 X X 1 5 0
stdout 0 6 4 2 stack Euler Tour: Example 0 Adjacency list 3 0: 1 2 5 61: 0 22: 0 3 4 13: 4 24: 6 5 3 25: 4 06: 4 0 X X X X 1 2 6 X X 4 X X X X 5 X X 0 X 3 4 X X X X X 2 X X 1 5 0
stdout 0 6 4 2 3 stack Euler Tour: Example 0 Adjacency list 0: 1 2 5 61: 0 22: 0 3 4 13: 4 24: 6 5 3 25: 4 06: 4 0 X X X X 1 2 6 X X 4 X X X X 5 X X 0 X 3 4 X X X X X 2 X X 1 5 0
0 6 4 2 3 4 stdout stack Euler Tour: Example 0 Adjacency list 0: 1 2 5 61: 0 22: 0 3 4 13: 4 24: 6 5 3 25: 4 06: 4 0 X X X X 1 2 6 X X X X X X 5 X X 0 X 3 4 X X X X X 2 X X 1 5 0
0 6 4 2 3 4 5 stdout stack Euler Tour: Example 0 Adjacency list 0: 1 2 5 61: 0 22: 0 3 4 13: 4 24: 6 5 3 25: 4 06: 4 0 X X X X 1 2 6 X X X X X X X X 0 X 3 4 X X X X X 2 X X 1 5 0
0 6 4 2 3 4 5 0 stdout stack Euler Tour: Example 0 Adjacency list 0: 1 2 5 61: 0 22: 0 3 4 13: 4 24: 6 5 3 25: 4 06: 4 0 X X X X 1 2 6 X X X X X X X X X 3 4 X X X X X 2 X X 1 5 0
0 6 4 2 3 4 5 0 2 stdout stack Euler Tour: Example 0 Adjacency list 0: 1 2 5 61: 0 22: 0 3 4 13: 4 24: 6 5 3 25: 4 06: 4 0 X X X X 1 2 6 X X X X X X X X X 3 4 X X X X X X X 1 5 0
0 6 4 2 3 4 5 0 2 1 stdout stack Euler Tour: Example 0 Adjacency list 0: 1 2 5 61: 0 22: 0 3 4 13: 4 24: 6 5 3 25: 4 06: 4 0 X X X X 1 2 6 X X X X X X X X X 3 4 X X X X X X X 5 0
stdout 0 6 4 2 3 4 5 0 2 1 0 Euler Tour: Example 0 Adjacency list 0: 1 2 5 61: 0 22: 0 3 4 13: 4 24: 6 5 3 25: 4 06: 4 0 X X X X 1 2 6 X X X X X X X X X 3 4 X X X X X X X 5