THE SHORTEST PATH - 翻译成中文

• 最短路径
• 的最短途径
• 的最短路径
• 最短的之路

在 英语 中使用 The shortest path 的示例及其翻译为 中文

The weight of the shortest path from s to s is trivial: 0.
从s到s的最短路径的权重是微不足道的：0。

Move your personal folders(. pst) file to a location that has the shortest path name.
将您的个人文件夹(.pst)文件移动到具有最短路径名的位置。

A more complex problem asks if the shortest path through those cities is exactly that distance.
一个更复杂的问题是，通过这些城市的最短路径是否恰好等于那个距离，这个问题属于PH。

The presence of a negative cycles make our attempt to find the shortest path pointless!
负环的存在使我们试图找到最短路径的行为变得毫无意义！!

Selection is actually a sub problem of more complicated problems such as the shortest path problems and nearest neighbor problem.
选择是一些更复杂问题的子问题，如最近邻和最短路径问题。

Where d s(i, j) is the length of the shortest path between i and j.
令d(i,j)为i和j之间的最短路径的长度。

Now we can read the shortest path from s to t by iteration.
现在我们可以通过迭代来回溯出s到t的最短路径：.

The problem is to calculate the minimum required distance for the car to reach the user, in other words, find the shortest path between them.
问题在于计算车辆到达用户的最小距离，即寻找最短路径。

When the OSPF ISDB changes, the shortest path need be recalculated.
当OSPF的链路状态数据库（LSDB）发生改变时，需要重新计算最短路径。

Rivers flowing downhill, from river source to river mouth, do not necessarily take the shortest path.
河流从源头向地势低处流动，直到河口，其流动路径并不一定是最短路径。

Although this may improve the path length, we still do not get the shortest path.
这的确能够缩短路径的长度，然而我们得到的仍然不是最短路径。

Where d s(i, j) is the length of the shortest path between i and j.
C(i,j,n)则是从i到j的最短路径的长度。

Since A* doesn't consider higher-valued f nodes until it has considered lower-valued f nodes, it never strays off the shortest path.
由于A*在考虑f值较低的点前，不会考虑f值较高的点，因此它肯定不会偏离最短路径。

Let's try to calculate the shortest path based on the airtime between the airports AMA and PBI.
让我们尝试根据机场AMA和PBI之间的飞行时间来计算最短路径。

The working group was formed in 1988 to design an IGP based on the shortest path first(SPF) algorithm for use in the Internet.
这个工作组当时于一九九八年建立，他们当时只为鉴于最短路径优先（SPF）运算算法IGP的互联网设计。

For example, the shortest path between two locations and the best portfolio of securities investment can be optimized by mathematical modeling.
例如两个地点之间的最短路径、证券投资的最佳组合，都可以通过数学建模，得到最优化的解决方案。

But with Spark, you can find the shortest path between all vertices and cache that data in memory.
但是使用Spark，你可以找到所有顶点之间的最短路径，并缓存内存中的数据。

Finding the shortest path between some nodes is simple, but with increasing number of nodes the task gets extremely difficult to solve.
找到一些房屋之间的最短路径很简单，但是随着房屋数量的增加，解决这一任务变得非常困难。

At each step we find the unmarked state(i, j) for which the shortest path was found.
在每一步中，对于已经找到的最短路径，我们找到它所能到达的下一个未标记状态(i,j)，.

Measuring by arc length shows that the shortest path between two points lying on the sphere is the shorter segment of the great circle that includes the points.
弧长测量表明，球面上两点之间的最短路径是过这两点的大圆的较短的那一段圆弧。