An object-oriented view of backtracking

Authors:
Robert E. Noonan
Affiliations:
Dept. of Computer Science, College of Willam and Mary, PO Box 8795, Williamsburg, VA
Venue:
Proceedings of the thirty-first SIGCSE technical symposium on Computer science education
Year:
2000

Citing 9
Cited 0

Algorithms in C++

Algorithms in C++
Classic data structures in C++

Classic data structures in C++
C++ plus data structures

C++ plus data structures
Letters to the editor: go to statement considered harmful

Communications of the ACM
Algorithms + Data Structures = Programs

Algorithms + Data Structures = Programs
Systematic Programming: An Introduction

Systematic Programming: An Introduction
Data Abstraction and Problem Solving with C++: Walls and Mirrors

Data Abstraction and Problem Solving with C++: Walls and Mirrors
Data Structures and Algorithms in Java with Cdrom

Data Structures and Algorithms in Java with Cdrom
Data Abstraction and Structures Using C++

Data Abstraction and Structures Using C++

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we explore Wirth's[11] backtracking algorithm from the perspective of algorithm reuse and separation of concerns. We explore treatment of this problem in object-oriented data structures and algorithms texts. Finally, we present a reusable backtracking (or depth-first search) class.