算法的关键是判断一个结点是否是强连通分量的根。
The crux of the algorithm comes in determining whether a node is the root of a strongly connected component.
这个根结点是在深搜时碰到当前强连通分量的第一个结点。
The root node is simply the first node of the strongly connected component which is encountered during the depth-first traversal.
算法的输入是一个有向图，产生一个图的强连通分量顶点划分。
The algorithm takes a directed graph as input, and produces a partition of the graph's vertices into the graph's strongly connected components.
应用推荐