1. Example 1: Undirected adjacency graph Discretized polygon
Example clearing sequence:
1-2
1/1 -> 2
Directed information graph

2. Example 2: Undirected adjacency graph Discretized polygon
Example clearing sequences:
5/1 -> 4/1 -> 3/10 -> 2/0
3/11 -> 4/1 -> 3/10 -> 2/0
Directed information graph

3. Example 3: Directed information graph Discretized polygon
Undirected adjacency graph
Example clearing sequences:
1/1 -> 2/11 -> 3/1 -> 4/01 -> 5/0
4/11 -> 5/1 -> 4/10 -> 3/0

4. Example 4: Example clearing sequences: 1) 1-2-3-4-5
1/1 -> 2/11 -> 3/1 -> 4/01 -> 5/0 2)
7/11 -> 6/111 -> 5/1 -> 4/01 -> 3/0
Discretized polygon

5. Example 5: Example clearing sequence:
Node
Info State 10 1 9 01 8
011 7 6
0111 5 4 3 2
001
0011 12 13 18 19 20
0001 14 15 16 00
Example clearing sequence:
Discretized polygon

6. Example 6: Any path leads to recontamination, for instance:
Node
Info State 10 1 9 01 8
011 7 6
0111 5 4 3 2 11
Recontaminated!!
Oh no!

7. Example 7: Undirected adjacency graph
Not a chance…can’t clear anything
Discretized polygon
Directed information graph