查询词典 shortest path

Three intersection functions,such as adjacent node set,node-arc angle set and connected node set,were presented,and based on the shortest path method proposed by Dijkstra,a road guide sign model was built by using the intersection functions.

结合路网的拓扑结构，定义了用于确定指路标志的状态函数集，给出了3个描述路网拓扑特征的交叉口函数：邻近结点集、结点-弧段夹角集和连通结点集，基于Dijkstra最短路径的思想，运用交叉口函数建立了城镇指路标志的标识模型：以待标识城镇为中心，在城镇的影响区域内，通过向外搜索交叉口邻近结点集来确定指路标志的设置，并使每个结点上标识的路径都是最优的。

For the question of material transportation in emergency situation ,the paper gives an arithmetic operators,which changes the interval number order into real number order,and gives the arithmetic of interval number shortest path.

针对紧急状态下物资调配时间为区间数问题，在经典的Dijkstra算法基础上，通过定义一个算子，把区间数序关系转换成实数序关系，对区间数进行排序，给出了区间数的最短路算法。

In the paper, it is studied about the shortest path search in real-life situation in autonomous vehicle navigation system.

在自主车辆导航系统中如何实现符合现实状况的大范围的最短路径查询，是本文的研究问题。

Firstly, a spherical mesh with regular subdivision connectivity is constructed to partition the spherical domain into some small regions. Then the region, which contains the query point p, is found according to the position of p and selected as the search area for locating p. During the point location, the barycentric coordinates are used to extract local heuristic information about the location of p so as to find the shortest path from the start triangle to the target one containing p.

通过构造规则子分网格将原始球面网格区域划分成若干具有子分层次关系的查询小块；在进行查询前，根据查询点p的位置找到它所在的小块作为搜索区域，从而极大地缩小了查询范围；在查询过程中，根据重心坐标所包含的启发信息，选择一条从初始搜索三角形到目标三角形的最短查询路径。

The shortest path between two truths in the real domain passes through the complex domain.

（在实数域中，连接两个真理的最短的路径是通过复数域。

DMCA constructed a MCDS for Ad hoc networks based on a maximal independent set. In DMCA, each node only required the knowledge of its one-hop neighbors and there existed only one shortest path connecting two dominators these were at most three hops away.

DMCA基于最大独立集的构建，只需要周围一跳邻居的信息，在不超过三跳距离的一对支配节点之间找出一条最短路径。

For the np-hard problem of constructing minimum connected dominating set in ad hoc networks, this paper proposed a novel distributed mcds constructing algorithm called dmca. dmca constructed a mcds for ad hoc networks based on a maximal independent set. in dmca, each node only required the knowledge of its one-hop neighbors and there existed only one shortest path connecting two dominators these were at most three hops away.

摘 要：针对无线自组织分组网络中最小连通支配集创建np难问题，提出了一种分布式的最小连通集创建算法dmca.dmca基于最大独立集的构建，只需要周围一跳邻居的信息，在不超过三跳距离的一对支配节点之间找出一条最短路径。

GIS network path analysis is the hotspot of GIS research,while the shortest path is the most basic and the most pivotal problem,so the research on it was never interrupted.Based on the Dijkstra algorithm combined with the GIS its own chrematistics,a lot of improvement has been adopted compared with the traditional Dijkstra algorithm.

GIS网络剖析是GIS的研讨暖点和难点，而最短路径题目是GIS网络剖析中最基本和最关键的题目，海内外大量专家学者对最短路径题目入行过深入研讨，提出了多种解决最短路径题目的算法。

Image segmentation based on the graph concept is analyzed in our thesis, a boundary finding problem is formulated as a shortest-path problem in a graph, then a watershed algorithm based ort image foresting transfonn is introduced, which is a unified and efficient approach for simplifying image processing problems to a minimum-cost path forest problem .

将图的概念应用于图像分割的研究中，把边界发现问题归结为图中的最短路径问题，从而引入了一种基于图像森林化变换(Image Foresting Transform，该方法是把图像处理问题简化为在图中求解最短路径森林问题的一种统一有效的方法)的分水岭算法，并分析了平滑滤波、梯度阈值在图像分割中的作用。

Basing on this, this paper proposes a generalized shortest path method. That is, by constructing an intermodal-network multi-ply graph which interrelates the data and information in transit with the nodes and sides of the graph, adding virtual origin and destination stations to the graph, and then analyzing transport costs and transfer costs, this paper applies the Dijkstra algorithm to solve the intermodal optimal transport path problem so as to get the intermodal transport plan with the least generalized costs.

在此基础上，提出一种求解最佳运输路线的广义最短路法，即通过构建多式联运网络多重图，将运输过程中的数据、信息和图中的节点、边关联起来，然后对运输费用和中转费用进行分析估计，并通过在联运网络图中加入虚拟的发、到站，使得该问题可用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.

也许他们将在壶穴里消失