Back

Iterations

A representation of the complete tree is created to the right of the enumeration tree. It is reproduced for the example problem below. The tree vertices are listed in numerical order together with the levels at which they appeared and the actions taken for the vertex.

The green lines indicate where backtrack actions occurred. Note that the level number never increases at a backtrack. The last backtrack leads to level 0, the indication of termination.