查询词典 route order

Once his shopping plan is final (corresponding to a CPU executing instructions), he can certainly pick the fastest car and the shortest route in order to speed up things.

有一次，他是最后的购物计划（相当于一个CPU执行指令），当然他可以选择最快的赛车和最短的路线，以加快东西。

The AE4000 and predecessors offer a menu that remembers the adjustment you made previously, and will enable you to bypass the normal access route through the menu in order to get back to that same adjustment.

和前辈的AE4000提供了一个菜单，记住您所做的调整以前，并将使您能够绕过通过菜单的正常通道，以便回到同样的调整。

This has left the two parties with no other way forward and so the club, in agreement with the player, have decided to go down the surgical route in order to clean the inflamed left tendon.

这使得双方都没有更好的方法，最后俱乐部和本人决定通过手术清除发炎的肌腱。

The originating switch analyzes the number in order to route the call to the B Number, the number of the called party.

最初的交换机分析该号码，从而将该呼叫发送至B号码，即被叫用户。

Other necessities include a regular phone or a computer microphone, and a VoIP route adaptor in order for your phone to connect to the internet.

其它必需品包括定期电话或电脑麦克风一、网络电话为您的电话线插头接驳互联网。

Like with naval battles, you can hover your mouse over a company to get a sense of its status and morale, and because we had built up a decent number of low-level infantry units to outclass the local British militia, we were able to get many of them to route in short order.

海战一样，您可以将鼠标指向一个公司感受它的地位和士气，因为我们已经建立了一个体面的一些低级别的步兵部队向当地英国outclass民兵，我们能够得到许多人的路线在短期内。

Such networks have to keep track of where subscribers are, as they roam from cell to cell, in order to route calls and text messages.

当移动用户因打电话或发信息从一个发射区域漫游到另一个发射区域时，移动电话网络必须清楚用户的位置。

Next comes a set of up to 100 gas station specifications, describing all the gas stations along your route, in non-decreasing order by distance.

接下来是最多100个的油站说明，描述了你途经的所有油站，按照距离非递减的顺序。

Formerlyany of a number of men placed at stages along a route in order to ride to the next stage with letters,etc.

旧时驿站之间骑马传送信件等的人。

Dijkstra algorithm and matrix iterative algorithm are important algorithms of the shortest route problem.In order to find which of the two algorithms is more efficient,the two algorithms were discussed,and their program flows were introduced.

Dijkstra算法和矩阵迭代算法都是最短路径问题的经典算法，为了研究这2种算法的计算效率，介绍了2种算法的基本思路和程序流程；通过对时间复杂度、结果和时间的关系指标进行多次计算，表现2者之间的效率差异。

The split between the two groups can hardly be papered over.

这两个团体间的分歧难以掩饰。

This approach not only encourages a greater number of responses, but minimizes the likelihood of stale groupthink.

这种做法不仅鼓励了更多的反应，而且减少跟风的可能性。