1·You create a priority queue with these set of commands
使用下面的命令创建一个优先级队列
2·However, violating the spirit of the priority queue is necessary in this situation.
然而，在这种情况下，必须违反一下优先级队列的设计思想。
3·The thread scheduler must dispatch from the head of the highest-priority queue that is not empty.
线程调度程序必须从非空的最高优先级队列的头部开始调度。
4·In a serious program this priority queue might be based on a heap, as described in Chapter 12, "Heaps."
在正式的程序中，优先级队列可能基于堆来实现，正如第12章“堆”所描述的。
5·This necessitates looking through the priority queue item by item, to see if there's such a duplicate edge.
这使得在优先级队列中逐项查找成为必要的一步操作。
6·First of all, congestion index of priority queue is explicitly defined based on the analysis of dynamic flow-awareness.
在对动态流感知进行分析的基础上，定义了优先队列的拥塞指数。
7·Find all the edges from the newest vertex to other vertices that aren't in the tree. Put these edges in the priority queue.
找到从最新的顶点到其他顶点的所有边，这些顶点不能在树的集合中。把这些边加入优先级队列。
8·Similarly, when a notify() is done, the thread from the front of the highest-priority queue of waiters is unblocked from its wait.
类似地，完成 notify() 以后，等待者的最高优先级队列前端的线程从等待中解除阻塞。
9·As it turns out, it is easier to keep only one edge from the tree to a given fringe vertex in the priority queue at any given time.
这样做了以后，要使优先级队列中在任意时刻只保持一条从树中顶点到某边缘点的边就变得容易了。
10·This gem lets you fire off jobs in one line of code and implements a priority queue so that your important jobs don't wait behind routine jobs.
您可以在一行代码中使用这个gem清除所有任务和实现优先级队列，这样您的重要任务就不需要在例程作业后等待了。