The Shortest-Path Problem的意思|示意

The shortest path problem with two additional constraints in transition time and number of edges is NP Complete.

带时间和边数约束的双约束最短路问题是NP完备的。

Aiming at the uncertain networks, the shortest path problem with stochastic parameters is studied and the expected value model with constraints is constructed.

针对不确定网络，研究具有随机参数的最短路径问题，采用随机数表示路径权值的不确定性，建立有约束的期望最短路模型。

The shortest path problem, in which label algorithms are of consequence, is a research topic in the field of geographic information science and computer science.

最短路径算法是计算机科学与地理信息科学领域的研究热点，而标号算法则是最短路径算法中的重要一族。

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

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

Although in this situation we're interested in the cheapest fares, the graph problem is nevertheless always referred to as the shortest path problem.

可能在带权图中最常遇到的问题就是，寻找两点间的最短路径问题。

Furthermore, the study of the shortest path problem in dynamic and stochastic networks (DSNs) not only has important practical value, but also has high theoretical significance.

本文针对动态随机网络最短路径问题进行了较为深入的系统研究。