在 中文 中使用 的最短路径 的示例及其翻译为 英语
{-}
-
Political
-
Ecclesiastic
-
Programming
中介中心度(BetweennessCentrality)：计算经过一个点的最短路径的数量。
Betweenness centrality(BC): the number of shortest paths that pass through a given node.最坏情况下，该问题会变得简单了，即所有的不确定的边都被移除该问题将会变成通常的最短路径问题。
The worst case for this problem is simply that all of the unreliable edges fail and the problem reduces to the usual Shortest Path Problem.然后，这个名为HashPairMiner的算法在这个干净的网络中搜索一对搜索词及其中间的标签之间的最短路径。
Then 了解最短路径的含义。
Know the meaning of shortest path.求最短路径的长度。
通过对称性可以找出特殊点，例如强调的时间最短路径。
These symmetries draw attention to specific points, emphasizing, for example, the time-minimizing path.的最短路径树。
The shortest path tree.从s到s的最短路径的权重是微不足道的：0。
The shortest path distance from s to itself is 0.Floyd-Warshall算法解决了求所有顶点对间的最短路径这一问题。
The Floyd Warshall Algorithm is for solving the All Pairs Shortest Path problem.基于成本的最短路径.
It's the shortest path in terms of the cost.同样是实现从S到E的最短路径。
It is also the shortest path from s to x.Internet选择从发送方到接收方的最短路径。
We have selected the shortest path from sender to receiver.这将是通向中国的最短路径。
The shortest route to China.从u到v的最短路径。
There is no shortest path from u to v.则是从i到j的最短路径的长度。
Find the length of a shortest path from i to j.成千上万的人每天都在街上逛，因为它是从Terazije酒店至卡莱梅格丹公园和要塞的最短路径。
Thousands of people stroll along the street every day as it is the shortest path from Terazije to Kalemegdan park and fortress.这种方法的主要优点是我们总能找到达到目标的最短路径。
Key advantage of this approach is that we will always find the shortest path to the goal.确定根网桥后，STA会计算到根网桥的最短路径。
After the root bridge has been determined, the STA calculates the shortest path to the root bridge.我们现在想找到从一个节点到另一个节点的最短路径。
We want to find now the shortest path from one node to another node.接近中心性（ClosenessCentrality）-从某节点到所有其他节点的最短路径的平均长度。
Closeness centrality: the average shortest path distance from an individual to all others.
