Before SQL is executed, the DB2 optimizer estimates the cost of the candidate access paths and selects the path with the least estimated cost.
在执行SQL之前，DB 2优化器会评估候选访问路径的成本，然后选择成本最低的路径。
So the most optimal path planning is regard as the problem of searching for roads which have the least cost in a road net.
所以，最优路径规划最终都可以归结为在特定的道路网络中搜索总代价最小的目标路径问题。
The first one is community model based on shortest path, the second one is based on least cost by introducing a turn penalty, the last one is community model based on probability and turn penalty.
第一种是社区最短路径模型，第二种是社区最小代价模型，第三种是引入概率的最小代价模型。
Because the different factors are considered, such as time, cost and capacity of roads, problem of the shortest path can be treated as problem of the fastest or least cost.
由于路径规划中考虑的因素可以不同，如时间、费用、道路的容量等，最短路径问题就可以引申为最快、最低费用路径问题。
Examine all possible routing paths across routing group connectors and select the routing path that has the least total cost.
检查穿过路由组连接器的所有可行路由路径，然后选择具有最低总开销的路由路径。
Using STP algorithm, the least cost paths between nodes are computed when computing the working tree, so the best backup path can be found as soon as the failure occurs.
在组播树建立之初，计算好组播节点之间的最小代价路径，以便于出现故障之后寻找最优备用链路；
Using STP algorithm, the least cost paths between nodes are computed when computing the working tree, so the best backup path can be found as soon as the failure occurs.
在组播树建立之初，计算好组播节点之间的最小代价路径，以便于出现故障之后寻找最优备用链路；
应用推荐