In [9] we introduced the concept of Complete Traversal as a generic iteration mechanism which allows its user to apply a given function to all of the elements in a container, including those that could eventually be inserted by the function in question. This paper follows up on the issue of addressing the question of how general this iteration scheme is. The way of approaching this question is by comparing the complete traversal (CT) problem with well-known problems such as the computation of the transitive closure (TC) of a relation, and the computation of the closure of a set under a given relation (CR). We formally define the meaning of problem and the relation is an instance of among problems, to prove that TC and CR are indeed instances of the CT problem, and present a diagram which depicts the relation is an instance of among CT, TC, CR, and other well-known problems. Keywords: Generic Programming, Complete Traversals, Closures, Standard Template Library (STL), Iterators, Iterat...