A graph search algorithm that will find the shortest path with some given property, even when the graph contains cycles. When searching for a path through a graph, starting at a given initial node, where the path (or its end node) has some desired property, a depth-first search may never find a solution if it enters a cycle in the graph. Rather than avoiding cycles (i.e. never extend a path with a node it already contains), iterative deepening explores all paths up to length (or “depth”) N, starting from N=0 and increasing N until a solution is found.
[it-uh-rey-tiv, -er-uh-tiv] /ˈɪt əˌreɪ tɪv, -ər ə tɪv/ adjective 1. repeating; making repetition; repetitious. 2. Grammar. . /ˈɪtərətɪv/ adjective 1. repetitious or frequent 2. (maths, logic) another word for recursive See recursive 3. (grammar) another word for frequentative adj. “involving repetition,” late 15c., from French iteratif (c.1400), from Late Latin iterativus, from iterat-, past participle […]
programming An object or routine for accessing items from a list, array or stream one at a time. By extension, the term can be used for an object or routine for accesing items from any data structure that can be viewed as a list. For example, a traverser is an iterator for tree-shaped data structures. […]
spelling It’s spelled “Internet”. (1997-04-07)
/ˈɪtərəʊˌpærəs/ adjective 1. Also polycarpic. (of a plant) producing flowers and fruit more than once (usually many times) before dying 2. (of an animal) producing offspring more than once during its lifetime