Shortest Path

Research on the shortest path in a flying range

关于航程中最短路径的研究

This article introduce a way called layer shortest path way based on conventional shortest path way.

论文中提出了一种基于常规最短路径方法的分词算法:层进式最短路径分词方法.

This paper deals with TSP by transform TSP to a special Shortest Path Problem.

本文将解决TSP问题转化为一种特殊的最短路问题.

This article discusses a new algorithm which gets the shortest path between two points in a city's road net.

文中从城市道路网络的特点出发，分析了道路路段间的连通关系，得出一种求城市道路网络两节点间的最短路径的算法。

A multiobjective shortest path evolutionary algorithm is presented for acyclic directed graph.

提出一种无圈有向图条件下的多目标最短路径进化算法.

The OSPF open shortest path first refresh mechanism can cause periodic bursts of traffic on networks.

协议的报文刷新机制会产生大量的报文,给网络带来很大的突发流量.

Based on Shortest Path Heuristic and Greedy algorithms, using path similarity principle and genetic operations, provides a heuristic algorithms in finding multiple feasible paths for multiple constraints ( k-SPH).

基于最短路径（SPH）和Greedy算法，使用路径相似性原：理和遗传算法的变异操作，提出了寻找满足1个或2个约束条件的多路径启发式算法（称为k-SPH算法）。

It resolves problems of real time receiving and processing of GPS signal, real time displaying GPS location signal, modifying the error of road matching method, the abstraction and construction of the topological structure of city road network, and the shortest path navigation, etc.

重点解决了GPS信号实时接收与处理、GPS定位信号实时显示、道路匹配算法误差修正、道路网网络拓扑结构的提取与构架、最短路径导航等技术问题。

Shortest path analysis is one of the basic problems of GIS network analysis.

最短路径分析是地理信息系统（GIS）中网络分析的一项重要功能，等价于图论中的节点间求解最短路径问题。

Therefor, the performance of the shortest path tree generated by FLSPT or the DDSP is same, but the efficiency of FLSPT is better than DDSP.

因此，FLSPT算法计算得出的最短路径树性能与DDSP算法一样，但计算效率比DDSP算法高。

Requirements: on the network using Dijkstra algorithm to find single-source shortest path.

要求: 对有向网络用Dijkstra算法 求出 单源 最短路径.

Low-cost shortest path tree is a commonly-used multicast tree type.

低代价最短路径树是一种广泛使用的多播树.

Link State algorithm called the shortest path first SPF ( Short Path First ) algorithm.

链路状态算法又叫最短路径优先SPF ( ShortPathFirst ) 算法.

The models of shortest path arborescence game and weighted shortest path arborescence game are established and the imputations of this cooperative game in many cases are obtained.

建立了最短路树形图对策和加权最短路树形图对策模型，并求出了此对策问题在多种意义下的分配。

SAP matrix graph theory algorithm for getting the basic idea is to map shortest path problem.

图论算法求SAP矩阵的基本思想是图的最短路的问题.

Redundant links that are not part of the shortest path tree are blocked.

不是最短路径的备援连结将被阻隔.

Dijkstra by C is so great for solving algorithm find the shortest path with weight!

迪杰斯特拉的C是如此之大的求解算法寻找最短路径的重量!

The shortest path counting problem is applied in many aspects of societies.

数最短路问题在社会生活中有着广泛的应用。

This paper presented TDRA ( Table-lookup Deterministic Routing Algorithm) in triple-based hierarchical interconnection network, which always delivers the message along the approximately shortest path between any two nodes.

针对基三分层互连网络，提出一种基于查表的使消息沿两节点间近似最短路径传递的分布式确定路由算法TDRA。

The weighted shortest path arborescence game. A DNA Solution to Weighted Hamilton Path Problem

加权最短路树形图对策问题。赋权Hamilton路的DNA计算模型

This paper is to study the shortest path problem with fuzzy parameter.

本文研究具有模糊参数的最短路径问题.

Specific functions include a 2-point shortest path between the dynamic display, the segment length annotation.

实现了VB, MO最 短路径搜索.具体功能包括,2点间最短路径动态显示, 各段长度标注.

FIGURE 5. Determining the shortest path from the origin to the destination.

图5. 决定从出发点到目标点的最短的路径.

Algorithms of shortest path for raster network based on map algebra

网络最短路径的地图代数栅格算法

Prim algorithm to find shortest path in graph complete source code, has been tested.

普里姆算法寻找最短路径图中完整的源代码, 已经过测试.

A high-efficient algorithm to seek the shortest path arborescence and all shortest paths between any two vertices in DAG is presented.

无回路网络是一类重要的网络，给出在无回路网络中求解最短路树形图和任意顶点对间最短路的高效算法。

Node path length can be calculated in accordance with the shortest path!

可以根据节点路径长度计算最短路径! -Vc6.

This paper has introduced how to form the topological diagram of random network with C++ language, including QoS route information, and simulating the best route finding which satisfies certain condition in realistic network by finding the shortest path in topological diagram of random network.

介绍了如何使用C++语言形成包含QoS路由信息的随机网络拓扑图，并通过在网络拓扑图上寻找最短路径来模拟在现实网络中满足一定条件的最优路径选择算法。

The shortest path problem with complex constraints is described, and the application of deviation algorithm, a kind of k shortest paths algorithms, to this problem is introduced.

介绍了有复杂约束的最短路由问题，应用K路由算法中的偏离算法解决该类问题。

Study on Shortest Path Algorithm of Time-varying Road Network

时变道路网最短路径算法的研究