Table 1 Data Structure for U
From: A linear delay algorithm for enumerating all connected induced subgraphs
U | 2 | 3 | 5 | 4 | 7 | 9 | Â | Â | Â | Â | Â | Â | Â | Â |
C | 1 | 3 | 5 | 4 | 6 | 7 | 9 | 10 | 8 | 14 | Â | Â | Â | Â |
v | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | 13 | 14 |
D[v] | 1 | 0 | 1 | 2 | 1 | 2 | 3 | 4 | 3 | 3 | - | - | - | 4 |
P[v] | 2 | -1 | 2 | 3 | 2 | 3 | 4 | 7 | 4 | 4 | - | - | - | 9 |