最短路问题

It can be solved in O(n 2) time for single convex polyhedron obstacle (here n is the total number of vertices of polyhedron).

文章主要研究了k＝ 2情形下的最短路问题，提出一个在O（n2）时间内解决该问题的算法。

A new method of slope stability, limit equilibrium finite element method based on Dijkstra algorithm, was established by applying the improved Dijkstra algorithm which was an algorithm to seek the shortest path in graph theory to search for the minimum safety factor of slopes and the position of most dangerous sliding plane.

通过引入图论中解决最短路问题的Dijkstra算法到搜索边坡最危险滑动面及其安全系数中去，对Dijkstra算法作了一定的改进，建立了一种新的边坡稳定性分析方法―基于Dijkstra算法的极限平衡有限元方法。

For the purpose of solving the shortest path problem between any two nodes on urban traffic networks, We present a mixed connected graph representing the urban transportation networks, and choice set of main line is proposed in our disertation, according to urban road layout and rule of vehicle rout, we supposed a multi-phase labeling algothrim base on classical Dijskra labeling algorithm, a list of examples for all possible relation between two nodes are provided, all the examples is calculated by the proposed computer program, which indicates that this algorithm is feasible and effective.

为了研究城市路网上任意两顶点间的最短路问题，结合城市交通特点提出了最小干线选择集的概念，在著名的Dijkstra算法基础上，根据城市路网布局和配送车辆行车规则，给出一种多阶段定向搜索标号算法。

Making use of optimality principle, we get the mathematical model of this practical problem.

再用其它求最短路问题的某些算法求解这个实际问题，几种算法进行对比，从而得出该模型的优缺点。

In this paper we discuss the applications of weighted graph from three aspects including the shortest path problem,Chinese postmen problem,and match problem .

本文选取了赋权图应用的三个方面进行讨论，分别是最短路问题、中国邮递员问题和匹配问题的应用。

The DAN algorithm could be applied to the problem of the shortest path only to analyze the recordation of the front DNA chain.

将算法推广到最短路问题的不同之处在第三步，即只需分析在表面上排在最前的DNA链的实验记录就得到最短路。

When a shortest path between nodes is searched with this algorithm,a lot of repetitional computations are involved,so that the efficiency is low.

借助于矩阵算法来求最短路问题比较有效[1]，但当节点比较多时，计算的矩阵多，重复计算量大，降低了计算效率[2，3]。

The shortest path problem is a basic problem in network design,which is NP-complete.

最短路问题是一个经典的NP-完全问题，在网络设计里有着重要的作用。

The shortest path problem of dynamic directed networks is significant in the disciplines of transportation and communication systems.

有向网络的最短路问题在交通、通信系统的最优路径计算以及多阶段决策过程的最优轨线设计等实际问题中有着重要应用。

Firstly, we use the algorithm of Dijkstra in shortest path problem to find the paths of shortest cutting in stone material industry.

首先，利用最短路问题的Dijkstra算法，找出了石材切割的最优切割路径。

As she looked at Warrington's manly face, and dark, melancholy eyes, she had settled in her mind that he must have been the victim of an unhappy attachment.

每逢看到沃林顿那刚毅的脸，那乌黑、忧郁的眼睛，她便会相信，他一定作过不幸的爱情的受害者。

Maybe they'll disappear into a pothole.

也许他们将在壶穴里消失