The strongly connected components form the subtrees of the search tree, the roots of which are the roots of the strongly connected components.
强连通分量形成了搜索树，他们的根就是强连通分量的根。
The algorithm takes a directed graph as input, and produces a partition of the graph's vertices into the graph's strongly connected components.
算法的输入是一个有向图，产生一个图的强连通分量顶点划分。
应用推荐