Advertisement

Tree traversal (backtracking)

  • Alexander Shen
Part of the Modern Birkhäuser Classics book series (MBC)

Abstract

In the preceding section we considered several problems of a similar type: “generate all the elements of some set A”. The scheme used to solve these problems was the following one: A linear ordering on A was imposed and a procedure to generate the next element of A (according to that order) was described. Sometimes this scheme cannot be applied directly. In this chapter, we consider another useful approach that allows us to generate all elements of some set. It is called “backtracking” or “tree traversal”.

Keywords

Position Tree Current Position Knapsack Problem Diagonal Line Boolean Variable 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media New York 1997

Authors and Affiliations

  • Alexander Shen
    • 1
  1. 1.Institute of Problems of Information TransmissionMoscowRussia

Personalised recommendations