拓扑排序的算法，按前驱计数为0的顶点号在同一批输出，以突显这些任务是可并行进行的-Topological sorting algorithm, according to the vertices of precursor count number is 0 in the same batch of output, in order to highlight these tasks can be carried out in parallel

简化数据模型、减少数据处理时间、提高成型效率。算法无需建立三角面片之间的拓扑关系，可直接进行切片分层，切平面与网格面片所得的交线段也无需排序，节省了生成轮廓线时对交线段重新排序所需的时间，提高了分层处理的效率。-Simplify the data model, and to reduce the data processing time and improve the molding efficiency. Algorithm without establishing the topologic

数据结构中的有向图的拓扑排序算法基础程序，可在此基础上进行更改，主要构造了无向图、有向图和逆邻接图，使用c语言编程。-Data structure topological sort algorithm of the directed graph based program that can be changed, on the basis of the main structure undirected graph and directed graph and inverse adjacency