ITERATIVE DEEPENING
\ˈɪtəɹətˌɪv dˈiːpənɪŋ], \ˈɪtəɹətˌɪv dˈiːpənɪŋ], \ˈɪ_t_ə_ɹ_ə_t_ˌɪ_v d_ˈiː_p_ə_n_ɪ_ŋ]\
Sort: Oldest first
-
A graph search algorithm that will find theshortest path with some given property, even when the graphcontains cycles. When searching for a path through a graph,starting at a given initial node, where the path (or its endnode) has some desired property, a depth-first search maynever find a solution if it enters a cycle in the graph.Rather than avoiding cycles (i.e. never extend a path with anode it already contains), iterative deepening explores allpaths up to length (or "depth") N, starting from N=0 andincreasing N until a solution is found.
By Denis Howe
Word of the day
Snake's-head
- Guinea-hen flower; -- so called in England because its spotted petals resemble the scales of a snake's head.
Nearby Words
- iterated
- iterated function system
- iterating
- iteration
- iterative
- iterative deepening
- iterator
- iteravirus
- iteraviruses
- iternet
- ites