关于《偏序集上的一种拓扑排序》一文的几点意见

就文献《偏序集上的一种拓扑排序》一义提出了几点看法，探讨了文献中给出的祖先数算法、支配排序算法中的问题，并就其中的dominate函数、函数的时间复杂度的计算以及文献中给出的定理2的正确性进行了分析和论证，并指出了文献中所举例子中存在的差错．最后，对拓扑序列的合理性做了简单的讨论．

A Few Views about "A Topological Sorting in Partial Ordered Set"

This paper put forward Views to a literature titled " A Topological Sorting in Partial Ordered Set".Its make Explores for algorithms are Respectively named "Number of ancestors" and "dominate sorting",and give analysis and demonstration to dominate function,time complexity of the function,and the correctness of Theorem 2 at the literature, and point out the errors that exist in example of the literature.At last,do a simple discussion about rationality of topological order.