at.logic.gapt.utils.executionModels.searchAlgorithms
Removes the topmost element and returns the resulting collection
Puts a new element into the collection
Returns the size of the collection
Returns the topmost element without changing the collection
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.