a topological sort is carried out on a directed graph with no cycles. such a graph is called a directed, acyclic graph, often abbreviated dag.
拓扑排序必须在无环的有向图中进行。这样的图叫做有向无环图,缩写为dag。
this paper discusses the application of adjacency matrix at the algorithm's analysis for traversing graph, minimum cost spanning tree, topological sort and critical path.
对邻接矩阵在图的遍历、最小生成树、拓扑排序和关键路径等算法分析上的应用作了一定的探讨。
ptsa provides many possible choices for all sub-projects in a project which will be arranged in serial or parallel way, so ptsa improves the applied value of topological sort algorithm.
ptsa算法为工程中各子工程的串行或并行安排提供了确定的选择,提升了拓扑排序算法的实用价值。
the topological sort is an important operation of directed graphs. th is paper presents a linear algorithm to obtain a more reasonable topological sorting in…
摘 要拓扑排序是有向图的一种重要运算。 用一种线性的算法得到有向无圈图的一个更趋于合理的拓扑序列。
if you need a more esoteric kind of sort routine, you might want to check out the tsort command, which performs a topological sort on a file.