iterative deepening

I i

Transcription

- US Pronunciation
- US IPA

- US Pronunciation
- US IPA

Definition of iterative deepening words

noun Technical meaning of iterative deepening (algorithm) 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. 1

Just one definition for iterative deepening

Information block about the term

Parts of speech for Iterative deepening

noun

adjective

verb

adverb

pronoun

preposition

conjunction

determiner

exclamation

Full grammatical hierarchy of Iterative deepening

See also

All definitions of iterative deepening

Matching words

Was this page helpful?

Yes No

Thank you for your feedback! Tell your friends about this page

Tell us why?