全部

1·Python: Breadth First Search capable of returning largest distance?

广度优先搜索能够返回的最大距离？

2·Is it because the breadth first search always finds the shortest path?

这是因为广度优先搜索，总能找到最短路径？

3·A novel Unit Tree-based Breadth First Search (UTBFS) algorithm is proposed.

提出基于单元树结构的广度优先搜索算法utbfs。

4·Diffuse water source routines for the implementation of the breadth first search algorithm of diffuse water easy language breadth first search.

易语言广度优先搜索实现漫水法源码例程程序通过广度优先搜索实现了漫水算法。可用于去除图像杂色，分割图像等。

5·The shortest topological distance between two atoms in a structure was designed according to the widely used breadth first search algorithm which uses a data structure called Queue.

分子结构中任意两个原子之间最短拓扑距离的求解是建立在采用队列数据结构的宽度优先搜索算法基础上的。

6·A topology analysis method based on adjacent relation of elements in the network and Breadth first search is realized combined with Graph theory and the characteristics of power grid.

结合图论理论和电网的特点，实现了一种基于元件邻接关系和广度优先搜索算法的网络拓扑分析方法。

7·This provides a breadth-first search.

这提供了一种广度优先的搜索。

8·SEARCH BREADTH FIRST is the default sequence and returns all data on the same level first before returning any data on the next level.

SEARCH BREADTH FIRST 是默认顺序，在返回下一层数据前会先返回同级的所有数据。

9·The pseudo column LEVEL can be used in the ORDER BY clause to return the result set in search breadth first sequence.

可在 ORDER BY 子句中使用伪列 LEVEL 按照搜索宽度优先顺序返回结果集。

10·Making use of precomputation, algorithm ERAMC simplifies network topology and USES a breadth-first search algorithm with priority to find a transmission path that satisfies multiple constraints.

ERAMC算法利用预先计算来简化网络拓扑，然后采用带优先权的宽度优先搜索算法寻找满足多个限制条件的传输路径。