一个拓扑序列(topological order)是 AOV 网络中顶点的线性序列,使得对图中任意两个顶 点 i 和 j,i 是 j 的前驱结点,则在线性序列中 i 先于 j。
基于48个网页-相关网页
...拓扑序列; 并行拓扑排序算法ptsa; 混合数据结构;十字链队列;实用价值 [gap=1449]keywords:topological sort algorithm; aov network; topological list; parallel topological sort algorithm(ptsa); mixed data structure; crossing link..
基于10个网页-相关网页
拓扑序列复杂性 Topological sequence complexity
算法能够执行是因为,如果一个顶点没有后继,那么它肯定是拓扑序列中的最后一个。
The algorithm works because if a vertex has no successors, it must be the last one in the topological ordering.
提出了一种在格的拓扑序列上进行概念聚类的快速算法,并且定义了概念聚类间基于偏序的层次关系。
Next, a fast fuzzy conceptual clustering algorithm is proposed to cluster the fuzzy concept lattice into conceptual clusters.
一旦删除它,剩下的顶点中必然有一个没有后继,所以它成为下一个拓扑序列中的最后一个,依此类推。
As soon as it's removed, one of the remaining vertices must have no successors, so it will be the next-to-last one in the ordering, and so on.
应用推荐