算法的输入是一个有向图，产生一个图的强连通分量顶点划分。
The algorithm takes a directed graph as input, and produces a partition of the graph's vertices into the graph's strongly connected components.
根据标号有向块的指数型生成函数，研究了具有唯一一个割点的标号有向连通图及所有割点都在一个块上的标号有向连通图的计数问题。
The essay has a study on enumeration question labeled oriented connected graphs with only one cut vertices and labeled oriented connected graphs that all of cut vertices are in same block.
现在有一些文献对有向图的强连通分量做了一些讨论，一般采用了递归的方法。
Many documents and papers nowadays have discussed the strong connected component of the directed graph, and the method they adopted is usually Recursion.
应用推荐