该词条未找到_海词词典

您要查找的是不是：

Shortest Path Transit Network Settings. 最短路径公交网络对话框。
Use a short path name if you can. 如果可以,请使用短路径名称。
The first set includes all groups for which the shortest path from the source routing group has already been determined. 第一个集合包含到源路由组的最短路径已被确定的所有组。
Generalized Multi-Protocol Label Switching (GMPLS) is used as the control protocol for ASON, of which the routing part is mainly governed by the Open Shortest Path First (OSPF) protocol. 摘要自动交换光网络(ASON)控制协议采用通用多协议标签交换(GMPLS)控制协议族，其路由部分主要为开放式最短路径优先(OSPF)协议。
However,shortcut is the shortest path but not will be the fastest. 然而，快捷方式虽然是最短的路，却未必是最快的。
The next page will discuss the shortest path algorithm. 下一页将讨论最短路径演算法。
Make sure that the path name is in a short path (DOS 8.3) format. 确保路径名称为短路径(DOS 8.;3)格式。
This name may not initially appear to be a short path name. 此名称初看起来不像是短路径名称。
The tools can be stochastic choose through shortest path from bidirectional. 双向随机最短路径选刀。
And alters their values to find a curve that flows along the shortest path. 并对其值进行调整以找到路径最短的曲线。
Redundant links that are not part of the shortest path tree are blocked. 不是最短路径的备援连结将被阻隔。
It uses Diffusing Update Algorithm (DUAL) to calculate the shortest path. 它使用散布更新演算法(DUAL)来计算最短路径。
The entrance is situated down a short path leading off Brick Lane. 入口位于一条通向布里克巷的不长的小路里面。
This paper deals with TSP by transform TSP to a special Shortest Path Problem. 本文将解决TSP问题转化为一种特殊的最短路问题。
Shortest path is based on cumulative link costs. Link costs are based on the speed of the link. 最短的路径是依据累计的连结成本来决定的。连结成本是依据连结速度来决定的。
It then adds the closest routing group to the set of routing groups for which the shortest paths have been determined. 然后,将距离最近的路由组添加到被确定为具有最短路径的路由组集合中。
On the basis of pointing out that some is SPE(C_3,f) graphs are supermagic if f(e_i)=2n,some results of super-magicness and the structure of label sets of the SPE(C_3,f) graph are given for general case so that some conclusions available generalized. 在指出f(ei)=2n时SPE(C3;f)等图是超魔图的基础上;给出了一般情形下SPE(C3;f)超魔性问题的几个结果以及其标号集的构造;推广了已有的一些结论.
Eg. A circuit can be considered to have a topological (or graph) view, consisting of a labeled set of nodes and a labeled set of edges. 拟译：我们可以用一种拓扑图来描述电路，它由一组带标记的节点和一组带标记的边组成。
It adds the closest routing group to the set of routing groups for which the shortest paths have been determined. 将距离最近的路由组添加到其最短路径已被确定的路由组集合中。
Optimized function of selecting shortest path, greatly improving working efficiency. 最短加工路径优化功能,大大提高工作效率。