查询词典 shortest path

At the same time,select three issues carries on solve by the Year 2008's ACM\ICPC finals:air condition machine is description the elbow of air conditioning installation problem,limited the quantity and types of air-conditioning pipe under the conditions of the installation of air-conditioning method;Password suspects,this problem is giving a system password letter combinations possible combinations and length under the conditions,to design an algorithm to calculate the correct arrangement of the password;Steam roller,this problem giving the situation of urban streets,drive steam roller from one point to another point of the shortest path,is used by how many time.

同时，选取了2008年度ACM\ICPC总决赛的三道题目进行求解：空调机器这一题描述的是对空调管的安装问题，在限定空调管数量和型号的条件下空调管可能的安装方法；密码嫌疑这一题求解的是在给定一个系统密码的可能的字母组合和长度的条件下，设计一个算法以算出正确的密码的排列方式；蒸汽压路机这一题是在给出城市道路情况的条件下，求两点间压路机走完最短路径总共所花费多少时间的问题。

A shortest path routing algorithm based transiently chaotic neural network is proposed.

提出了一种基于暂态混沌神经网络的最短路径路由算法。

Aiming at the problem, we propose a shortest path routing algorithm based transiently chaotic neural network.

论文针对这个问题，提出了一种基于暂态混沌神经网络的最短路径路由算法。

This paper presents a best-routing algorithm for public transportation systems on the basis of analyzing the shortest path algorithm in urban traffic network and the character of transit network.

在分析城市道路网络最短路径算法和公交网络的特点的基础上，提出公共交通系统最佳路径算法。

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.

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

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.

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

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.

也许他们将在壶穴里消失