查询词典 shortest path problem

Keywords: Shortest path algorithm, Transportation network, Restricted searching area, GIS

试验结果显示了本文提出的限制搜索区域算法的合理性与有效性

Problems of the shortest-path algorithm in a transportation network are studied and a transportation simulation model is put forward in which the road grades, the traffic condition and the rules of swerving are abstracted.

1引言自主车辆路径导航系统是智能交通系统的重要研究课题，它要求能够按照存储在其内部的数字地图的拓扑信息，实时的规划出一条全局最优路径用于车辆导航。

First, the distance matrix of public transportation line is introduced, then the directed relation graph is constructed. In the directed relation graph, we can give the optimal line by revised shortest path algorithms.

首先通过引入各条公交线路直达最短距离矩阵构造了公交网络直达关系图，在直达关系图上，利用修改了的最短路算法，即可求得最优换乘路线。

Based on this method two algorithms which use the adjacent shortest transversal path to detect scene change are designed, and experimental results prove that this method is suitable to deal with the special effect around the anchor person shot in News TV program.

基于这种方法本文设计了用相邻最短遍历路径进行场景分割的两种算法，实验的结果证明这种方法在处理新闻节目的播音员镜头的特殊效果时是很有效的。

However, the transmission lines among the shortest path from one node of the overloaded line to the other, might suffer from flow transferring most greatly after the overloaded line tripping for a "strong-receiver" system, in which generations and loads are distributed equably and generation capacity in load centre is large.

基于潮流转移的上述特点，本文根据事故前的网络拓扑结构、潮流分布状态、输电元件物理参数与系统电压等级等广域测量信息，针对两种不同的网络结构分别提出了相应的快速识别网络薄弱环节的图论方法，即输电断面快速搜索算法与潮流转移最短路径快速搜索算法。

For any two vertices u and v of a graph G, a u-v geodesic is the shortest path between u and v. The set I consists of all vertices lying on a u-v geodesic. For SV, I is the union of all sets I for vertices u, v∈S. The geodetic number g is the minimum cardinality among the subsets S of V with I=V.

对于图G内的任意两点u和v，u-v测地线是指在u和v之间的最短路。I表示位于一条u-v测地线上所有点的集合，对于SV，I表示所有I的并，这里u，v∈S，G的测地数g是使I=V的最小点集S的基数。

Small-world effect can be found in such model, furthermore, the average shortest path length is smaller than that of unipartite random networks.

二元随机网可以具有小世界效应，并且其平均最短路径长度比单元随机网还要小。

Barathrum will automatically take the shortest route to the target, therefore you need to know where that path will be.

或者另一片森林，知道裂魂人在冲刺时的路径很重要。

Barathrum will automatically take the shortest route to the target, therefore you need to know where that path will be.

或者另一片森林，知道裂魂人在冲刺时滴路径很重要。

In order to sum up the best mode of shopping, we collect inter-planning data of domestic and foreign large-scale shopping malls, to build up database of shopping malls, through using network analysis, to explore the best and shortest path of pedestrian flows, and using Binominal Logistic Regression to prove spatial complex degree and the impact of efficiency of shopping malls planning.

为了解人潮游逛行为规划之最佳模式，本文搜集国内、外大型购物商场之内部动线规划形式，建立其购物商场空间资料库，利用路网分析模组，从各种消费者游逛模式下不同的目的观点，对购物商场之内部空间资料进行验证与分析。

Aquatic or marsh-growing fern allies; known to have existed since the Cenozoic; sometimes included in Lycopodiales.

生活于水中或湿地的蕨类；从新生代生存至今；有时归于石松目之中。

The engine was uprated from a 90hp Franklin to a 125hp Lycoming.

改良过的引擎是从90hp到125hp莱康明富兰克林。