基本释义:

最短道路问题

网络释义

1)shortest path,最短道路问题

2)minimum length,最短

3)shortest path,最短路径

4)shortcut,最短行程

5)shortcut,最短路径

6)shortest distance,最短距离

用法和例句

Based on the definition of the confidence interval, using the methed of numerical calculation, the minimum length of confidence interval for the variance of the normal distribution are found.

99,在样本容量n从3到30的范围内,在正态总体均值未知的情形下,求得了方差σ2的最短置信区间,并对用通常方法求得的置信区间的长度与最短置信区间的长度进行了对比分析。

Briefly on the shortest path algorithm in the urban road network;

浅析城市道路网中的最短路径算法

The Realization of Shortest Path Algorithm in Traffic System;

最短路径搜索算法在交通系统上的应用

Study on the multi-modal shortest path in time-varying network;

时变网络下多式联运的最短路径问题研究

Cause analysis of improvedalgorithm of shortcut onselecting the favorite line;

浅析航线选择中的改进最短路径算法

The Improved Shortcut Algorithm and It s Application in Selecting Ship s Optimum Route;

改进最短路径算法在最佳航线选择中的应用

An applied algorithm of searching shortcut quickly;

一种实用的最短路径求解算法

Based on the shortest distance between the cylinder cutter axis and surrounding surface, the maximum gouging was obtained by comparing with the radius of cutter.

提出的柱刀干涉检测是基于最短距离的求取算法,获得刀轴与加工面间的最短距离,进而与刀具半径比较得到最大干涉量。

The paper construct the specimen of multi-dimensional space based on the definition of clustering,calculate the generator control sensitive to load and the Eulerian distance,partition the power system by the shortest distance method of clustering analysis.

根据聚类的定义构造了多维空间的样本集,计算发电机节点对负荷节点的控制灵敏度和各负荷节点间的欧氏距离,利用聚类分析中的最短距离法对电力系统进行分区。

By improving Dijkstra s algorithm,the Dijkstra s matrix algorithm,which is to calculate the shortest distance between two arbitrary vertexes in a weighted graph is proposed.

介绍了Dijkstra算法,对Dijkstra算法进行改进,提出了计算加权图中任意两点之间最短距离的算法——Dijkstra矩阵算法,给出了Dijkstra矩阵算法在Matlab语言中的实现,对一个具体例子,应用Dijkstra矩阵算法进行了验算。