iterative deepening

(algorithm)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.

单词	iterative deepening
释义	iterative deepening iterative deepening (algorithm)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.
随便看	krasukha krasyliv kraszewski, jozef ignacy kraszewski, józef ignacy krasznahorkai, lázló krater kraters krati kratinos k ratio k ration kratochvil, jaroslav kratochvíl, jaroslav kratogen kratom kratos capital kratt, ivan kratt, ivan fedorovich kratts, kauko kratts, kauko ottovich krat, vladimir krat, vladimir alekseevich kratylos kraulin, karlis kraulin, karlis ianovich