【depth-first_search】什么意思_英语depth-first_search的翻译_音标_读音_用法_例句_在线翻译

depth-first search

机械工程 | 计算机科学技术 | 电子、通信与自动控制技术

·2,447,543篇论文数据，部分数据来源于NoteExpress

abstract: Depth-first search (DFS) is an algorithm for traversing or searching tree or graph data structures. One starts at the root (selecting some node as the root in the graph case) and explores as far as possible along each branch before backtracking.

以上来源于: WordNet

There are two common approaches to searching a graph: depth-first search and breadth-first search.

有两种常用的方法可以用来搜索图：即深度优先搜索和广度优先搜索。

youdao
In the inference engine section, target-drive control, depth-first search and breadth-first search are adopted.

在推理机的设计中采用了目标驱动控制，以及深度优先搜索和广度优先搜索这两种搜索策略；

youdao
Using graph theory of adjacency matrix as a conversion, a depth-first search to the entire map, can be cut at all possible paths.

利用图论中的邻接矩阵作为转换点，深度优先搜索整个有向图，可以得到所有可能的切分形式。

youdao

更多双语例句

应用推荐

$firstVoiceSent

- 来自原声例句