breadth-first search的意思|示意

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.

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

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

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

The algorithm adopts a hierarchical structure in knowledge rule while the breadth and depth, first search is integrated in reasoning strategy.

该算法应用的知识规则采用分层结构，在推理策略上综合应用深度和广度优先搜索。

Then, a heuristic breadth-first search is applied for path planning to find an optimal path from an original position to an aim, directing virtual human walkthrough in environments.

然后，用启发式宽度优先搜索算法进行路径规划，产生从初始位置到目标位置的最优路径，引导虚拟人对环境进行漫游。

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

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

Python: Breadth First Search capable of returning largest distance?

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