这样做了以后，要使优先级队列中在任意时刻只保持一条从树中顶点到某边缘点的边就变得容易了。
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.
找到从最新的顶点到其他顶点的所有边，这些顶点不能在树的集合中。把这些边加入优先级队列。
Find all the edges from the newest vertex to other vertices that aren't in the tree. Put these edges in the priority queue.
由于桦木树刚开始叶子，为寻找比尔克·布兰奇钉从他们的秘密仰慕他们的房子边单身妇女的传统。
Because the birch tree is just starting to leaf, tradition as single women finding a birch branch nailed to their side of the house from their secret admirer.
应用推荐