数据结构中拓扑排序算法的实现  

Achieve of Topological Taxis Calculation in Data Structure

作　　者：李静[1] 

机构地区：[1]贵州商业高等专科学校计算机科学与技术系,贵阳550004

出　　处：《电脑编程技巧与维护》2013年第6期18-19,53,共3页Computer Programming Skills & Maintenance

摘　　要：介绍拓扑排序的算法,对于给出的事件结点网络,要求依次求出入度(或出度)为0的顶点,最终得到一组拓扑序列。通过对这一序列的分析、比较,判断该网络图是否为循环图,从而确立实际应用的可能性大小,并给出了计算机上机实现的源程序。This article aims to introduce the calculation for topological taxis. To provide events connected with network. It is demand that account the in degree equal to zero priority then through contrasting find out a batch of tological taxis. According analyzing and compare with this taxis, then estimate whether this web map is cycle map. Finally, establish the practice possibility application this web. This article get the source programs for computer operation, too.

关 键 词：拓扑序列 AOE网 数据结构 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]