В Вашем браузере деактивирован Javascript. Активировав его, Вы сможете пользоваться LexiTrainer, а также другими функциями.

англо » немецкий

английский)

depth-first search СУЩ.

Статья, составленная пользователем

Статья, составленная пользователем

depth-first search, DFS ИНФОРМ.

английский

Just as subtrees are natural for recursion (as in a depth-first search), forests are natural for corecursion (as in a breadth-first search). en.wikipedia.org

It is an informed search based on the idea of the uninformed iterative deepening depth-first search. en.wikipedia.org

This tree is known as a depth-first search tree or a breadth-first search tree according to the graph exploration algorithm used to construct it. en.wikipedia.org

This is not possible with a traditional depth-first search, which does not produce intermediate results. en.wikipedia.org

This can be accomplished in linear time using algorithms such as breadth first search or iterative deepening depth-first search. en.wikipedia.org

On the other hand, it can solve problem sizes that are several orders of magnitude beyond the scope of a depth-first search. en.wikipedia.org

It works exactly like depth-first search, but avoids its drawbacks regarding completeness by imposing a maximum limit on the depth of the search. en.wikipedia.org

Unlike depth-first search, however, this algorithm is impractical for most applications because of its potentially superpolynomial running time. en.wikipedia.org

They differ in whether this data structure is a stack (in the case of depth-first search) or a queue (in the case of breadth-first search). en.wikipedia.org

When applicable, the method takes far less time than naive methods that don't take advantage of the subproblem overlap (like depth-first search). en.wikipedia.org

Хотели бы вы добавить слова, фразы или переводы?

Пришлите нам новую статью.

английский