In search algorithms the closed list records the set nodes that have already been considered. It is required in graph search to avoid re-examining the same nodes. This is in contrast to the open list which records nodes that still need to be explored.
Used in Chap. 4: page 47
Also known as closed list