一旦删除它，剩下的顶点中必然有一个没有后继，所以它成为下一个拓扑序列中的最后一个，依此类推。
As soon as it's removed, one of the remaining vertices must have no successors, so it will be the next-to-last one in the ordering, and so on.
每次向树中添加顶点后，都要遍历优先级队列查找并删除这样的边。
We could go through the queue looking for and removing any such edges each time we added a new vertex to the tree.
提出一种新的基于顶点删除准则的多面体模型简化算法。
This paper presents a new method of polyhedral model simplification based on vertex removal criterion.
应用推荐