ABSTRACT
”Generate and test” programming technique (also called backtracking) is a method of search of solutions among a finite set of candidates. Similarly to the classical search paradigm, the principle of “Generate and test” consists of a finite set of candidates and a selection predicate which allows to decide whether or not a candidate is a solution to the considered problem. In the framework of “Generate and test” as well in that of classical search, the basic algorithmic technique aims at successively examining all the candidates. The main characteristic of the “Generate and test” technique lies in the fact that, contrary to classical search, the set of candidates is defined in comprehension. In graph theory, a theorem due to Euler provides a necessary and sufficient condition for the existence of one Eulerian circuit in a directed connected graph. This theorem asserts that an Eulerian circuit exists if for each vertex.
