Recursion-Based Visualizations of Search Algorithms in State-Spaces

Visualization is a technology frequently used to assist the learning of algorithms. In this paper, two program visualization proposals are presented, for search algorithms in state-spaces, such as backtracking and branch and bound algorithms. Firstly, it is studied the coding schemes more adequate to generate recursion trees which may represent search trees. Secondly, two novel visualizations are presented, called line views. They display the time evolution of the values handled during the search process for optimization problems, especially in branch and bound algorithms.