There is a shortest path algorithm to select optimal disassembly path of product and find disassembly path of product with multi-supply-source.
本文采用最短路径算法解决产品的最优拆卸路径的选择问题，产品拆卸众多提供源时的拆卸路径问题。
Abstract: a path searching algorithm using contour is presented to obtain the shortest path between two points on a curved surface under the slope constraint.
文摘：给出了一种基于等高线求解坡度约束下曲面上两点间最短路径的搜索算法。
A new algorithm is proposed, which solves the shortest path in a graph with the same length of the edges.
最后，全面阐述图的最短路径算法，提出改进算法，有效地解决了含有多条相同长度的单源点最短路径问题；
This paper gives a character of the network with no negative cycles, and an algorithm for the shortest path lengths in the network as well.
揭示了无负回路网络的性质，并给出了这种网络最短路长度的一种算法。
The shortest path algorithm is a classical problem of the best route algorithm, which has widespread application in many aspects.
最短路径算法是最优路径算法中的一个经典问题，它在实际生产生活中有广泛应用。
To solve the model, the shortest path and its length of every two nodes in the incomplete undigraph are calculated with FLOYD algorithm, and a predatory search algorithm is designed for the solution.
为了求解上述模型，首先利用FLOYD算法求得不完全无向图中各节点间的最短路径和最短路径长度，然后设计了捕食搜索算法对模型进行求解。
Meanwhile, combining these two ideas, we propose a new kind of single-source shortest path algorithm based on bucket structure, which has good time complexity and parallelism property.
同时，提出了结合这两类算法思想的一种基于桶结构的单源最短路径串行算法，算法具有好的运行时间复杂度和可并行性。
A topology maintenance algorithm based on the shortest path tree is proposed.
提出了基于最短路径树的拓扑维护算法。
A path searching algorithm using contour is presented to obtain the shortest path between two points on a curved surface under the slope constraint.
给出了一种基于等高线求解坡度约束下曲面上两点间最短路径的搜索算法。
On the progressive formation of a tree, the algorithm of solving a shortest path problem is raised in which a matrix computation is imitated.
依据树的逐步生成原理，仿照矩阵运算，提出了求解捷径问题的生成树算法。
The shortest path algorithm is a hot subject in graph theory, geographical information system, and traffic advisory and so on.
最短路径算法是图论、计算机网络、地理信息系统、交通咨询等诸多领域中研究的热门课题。
Secondly, based on the shortest path algorithm, a public traffic network-transit matrix and a non-transfer matrix are introduced to design the public traffic transfer algorithm.
通过对多种现有算法的分析，利用公交换乘矩阵性质，本文提出了一种求解公交网络最优路径的标准算法。
In order to solve the intelligent transportation system in transportation network analysis and the shortest path problem, this paper proposes a weighted identification S-graph shortest path algorithm.
为解决智能交通系统中交通运输网络分析和最短路径问题，提出加权标识s -图最短路径算法。
Three algorithms are presented for computing the shortest path between two arbitrary points on a polyhedral surface: One is an approximate algorithm;
提出计算多面体面上任意两点之间最短路径的算法：近似算法、最短路径或近似最短路径算法。
The method first calculates the link weights based on a given criterion. Then a modified Open-Shortest-Path-First (OSPF) algorithm is proposed to calculate the paths.
该方法首先根据特定准则计算各连接的权值，然后根据一种改进的最短路径选择策略确定路径。
The method first calculates the link weights based on a given criterion. Then a modified Open-Shortest-Path-First (OSPF) algorithm is proposed to calculate the paths.
该方法首先根据特定准则计算各连接的权值，然后根据一种改进的最短路径选择策略确定路径。
应用推荐