求有向图的强连通分支 Strongerst Connected Component
这个根结点是在深搜时碰到当前强连通分量的第一个结点。
The root node is simply the first node of the strongly connected component which is encountered during the depth-first traversal.
当从一个搜索树返回时，判断该点是否是一个强连通分量的根。
When the search returns from a subtree, the nodes are taken from the stack and it is determined whether each node is the root of a strongly connected component.
强连通分量形成了搜索树，他们的根就是强连通分量的根。
The strongly connected components form the subtrees of the search tree, the roots of which are the roots of the strongly connected components.
应用推荐