1) the breadth-first search(BFS) algorithm
广度优先搜索算法(BFS)
2) Breadth-first Searches (BFS)
宽度优先搜索(BFS)
3) breadth-first search
广度优先搜索
1.
Realization of dynamic emulation of river routing based on breadth-first search algorithm;
基于广度优先搜索算法的河流演进动态仿真的实现
2.
Solution of farmer s problem to pass through river by breadth-first search of graph;
利用图的广度优先搜索解决农夫过河问题
3.
The retrieval techniques are developed well from first centralized search to distributed breadth-first search to semantic search,and the performance is improved as well.
P2P网络搜索由初始中心搜索至分布式广度优先搜索,直至现在的结构化P2P网络的语义搜索,其技术得到了快速发展,性能也得到了提高。
4) Breadth first search
广度优先搜索
1.
Method for initializing K-means clustering algorithm based on breadth first search;
一种基于广度优先搜索的K-means初始化算法
2.
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.
结合图论理论和电网的特点,实现了一种基于元件邻接关系和广度优先搜索算法的网络拓扑分析方法。
3.
Based on breadth first search algorithm an equivalent model for complicated distribution system is constructed,and the reliability of distribution system is evaluated by zone node row vector algorithm.
基于广度优先搜索算法构造了复杂配电网络的等效模型,采用区域节点行向量法对复杂配电网络进行了可靠性评估。
5) BFS
广度优先搜索
1.
Distribution system reliability assessment minimal path method-BFS;
应用最小路-广度优先搜索的配电系统可靠性评估
2.
Distribution System Reliability Assessment Minimal Path Method-BFS;
应用最小路—广度优先搜索的配电系统可靠性评估
6) broad first search
广度优先搜索
1.
A clustering algorithm based on broad first searching neighbors;
一种基于广度优先搜索邻居的聚类算法
2.
The object-oriented model of electric network equipment was built in this study first,and then the electric network topology analysis of software was developed in broad first search method.
为解决电力系统网络拓扑结构变化时,能正确进行各种实时分析计算的问题,采用面向对象技术对电力系统各种元件进行建模,采用广度优先搜索法,开发出电网拓扑分析的仿真软件,通过对山西某地区电网主系统进行仿真,结果表明,该软件能快速有效的跟踪电网拓扑的变化。
补充资料：表优先级算法
表优先级算法
list priority algorithm
b 100 youx一anli suanfa表优先级算法(list priority al即rithm)按照物体离视点的远近进行优先级排序从而对图形实施有序绘制的一种消隐算法。该算法的处理过程与画家创作一幅油画类似，先画远景，再画中景，最后画近景。因而该算法在处理简单元素(如多边形)时常被称为油画算法。 表优先级算法首先根据物体深度进行排序，按照环境中各元素离视点的远近确定一个深度优先级表。然后按照表中元素的先后次序，从离视点最远的图形元素开始，依次将每个元素绘制到屏幕画面中。这样，表中离视点较近的元素在绘制时会通过在帧缓冲器中写人新的内容而覆盖离视点较远的元素，从而达到消隐的目的。 当环境中各元素具有确定的深度次序时，该算法能准确地实现面消隐。但如果图形元素之间存在不确定的优先次序(比如元素之间在深度方向上交叉覆盖)时，则可以对物体元素进行一定的预处理，比如对交叉祝盖的元素进行分割，从而使之具有确定的优先次序。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条