A queue.
A queue. Turns the generic search into a BFS.
A stack.
A stack. Turns the generic search into a DFS.
A collection that can be used by generic search algorithms like DFS and BFS to store the list of nodes waiting to be expanded.
A collection that can be used by generic search algorithms like DFS and BFS to store the list of nodes waiting to be expanded.
Queue semantics turn the search into a BFS, stack semantics turn it into a DFS. IDBFS and acyclic A* are also possible.
Used as a node in DFS/BFS for searching through sets.
Used as a node in DFS/BFS for searching through sets. Specifically, the use case is the following:
Starting with the empty set as the root node, various supersets up to certain point are still valid elements and one wishes to to get the largest of these supersets.
E.g.: trying to perform resolution with as many pairs of variables as possible; finding a minimal set cover (with minimality corresponding to validity).