计算是结构化的，以有向图的方式进行：程序是图形顶点，而通道则作为图的边。
The computation is structured as a directed graph: programs are graph vertices, while the channels are graph edges.
算法的输入是一个有向图，产生一个图的强连通分量顶点划分。
The algorithm takes a directed graph as input, and produces a partition of the graph's vertices into the graph's strongly connected components.
在算法设计与实现中采用一个链接结构的“优先序列”，用它保证有向无回路图顶点的分层拓扑排序。
A "priority queue" which has a linked structure is used in this algorithm, which insures to complete LTP with the vertices in directed acyclic graph.
应用推荐