
Abstract Algorithms 4—Backtracking 337
1. 8-Queens problem tries to put 8 Queens on
a 8 × 8 chess-board, such that none threatens
the others.
2. Hamiltonian cycles is a path that visits
each vertex exactly once.
3. Adjacency list the information in an
Adjacency matrix expressed in form of a list of
triples like a
i
, a
j
, d
ij
).
4. Adjacency matrix see Key Terms in
Chapter 10.
5. Backtracking see Key Terms in Chapter 2.
6. Breadth fi rst search is a tree search
method in which all the children at a particular
level are visited before going down to the next
level.
7. Depth fi rst search is a tree search method
in which traversal goes ...