Definitions from Wiktionary (iterative deepening search)
▸ noun: (computer science, graph theory) A type of depth-first search in which each row of the tree is searched incrementally, simulating a breadth-first search with less memory usage.
▸ Words similar to iterative deepening search
▸ Usage examples for iterative deepening search
▸ Idioms related to iterative deepening search
▸ Wikipedia articles (New!)
▸ Words that often appear near iterative deepening search
▸ Rhymes of iterative deepening search
▸ Invented words related to iterative deepening search
▸ noun: (computer science, graph theory) A type of depth-first search in which each row of the tree is searched incrementally, simulating a breadth-first search with less memory usage.
Similar:
breadth-first search,
primitive recursion,
generalized search tree,
recursive descent,
tree,
subcycling,
AVL tree,
Reingold-Tilford algorithm,
subiteration,
uptree,
more...
▸ Words similar to iterative deepening search
▸ Usage examples for iterative deepening search
▸ Idioms related to iterative deepening search
▸ Wikipedia articles (New!)
▸ Words that often appear near iterative deepening search
▸ Rhymes of iterative deepening search
▸ Invented words related to iterative deepening search