Figure 1

A schematic illustration of a combinatorial search tree traverse: a – within Brute Force method, b – within Brute Force method with restricted number of analyzed branches, c – within Brute Force with restricted depth of analyzed subtrees. Analyzed branches are bolded.

© De Gruyter