本文提出的方法在目的端利用获得的中间节点位置信息来生成无向图，再利用广度优先遍历算法BFS计算出另外一条不相交路径。
This method USES intermediate nodes' location information to create undirected graph at destination node, and USES Breath-First Search (BFS) algorithm to find another disjoint path.
将最短路径的信息反馈到系统中作为搜索的指导信号，并改进节点选择方法，以提高应用蚁群算法搜索无人机三维航路的效率。
To improve the efficiency of path planning, the message of the shortest path was introduced in the system as a searching guidance signal, and a modified nodes selection method was also given.
该模型考虑到多路径的数目、路由的选取方法以及网络中节点的密度等条件，能够对不同网络条件下的负载进行较好的分析与理论计算。
This model took the number of paths, the way of route selecting and the density of the network nodes into account and could analyse or compute the load in different network conditions.
人工干预使蛇模型只能用于半自动的图像分割，该文在梯度向量流(GVF)蛇模型的基础上提出一种基于流场节点与最小路径方法的全自动图像分割算法。
In this paper, on the basis of Gradient Vector flow (GVF) snakes, a fully automatic image segmentation algorithm based on the analysis of flow field and the minimal path method is proposed.
本文综合考虑骨干网的大小、节点能量及路径，提出了一种基于广度优先搜索的数据收集树算法，并采用局部式方法进行维护。
This paper proposes a breath-first search based data collection tree algorithm that taking in account size of backbone, energy of node and path. The data collection tree is maintained locally.
经过与实际船舶布置情况对比，利用本文所提方法得到的管路连接路径节点等设计数据比较可靠，方法正确、可行。
Comparison results show that the proposed method is correct and effective; the data of connecting nodes of piping design is reliable.
采用这种方法进行挖掘，无需生成候选集，而且一次就可以挖掘出所有以根节点为后缀的连续频繁访问路径。
In the mining procedure no candidate generation is required, and only one time, we can obtain all the continuous access paths that take the root of IWAP-Tree as suffix.
采用这种方法进行挖掘，无需生成候选集，而且一次就可以挖掘出所有以根节点为后缀的连续频繁访问路径。
In the mining procedure no candidate generation is required, and only one time, we can obtain all the continuous access paths that take the root of IWAP-Tree as suffix.
应用推荐