摘要
有向图的拓扑排序有着极为广泛的应用,文章探讨了用多种计算机算法设计技术实现拓扑排序的思想。并且结合实例,提出了回溯法、分支限界法、贪婪算法、动态规划等方法的具体解决思路及其排序过程。
Topological orders of digraph are widely used in solving problems.In this article,the author discusses several computer algorithm methods to realize the thinking of topological orders .And at the same time,the author in practice,promotes the usage of several methods,such as backtracking method,branch and bound method,greedy method and dynamic programming,to specifically solve the mapping and its order processing problems.
出处
《电脑知识与技术》
2006年第2期107-107,118,共2页
Computer Knowledge and Technology
关键词
有向图
AOV
算法
拓扑序列
入度
Digraph
Activity On Vertex
Algorithm
Topological orders
In-degree