强连通（Strongly Connected）是指一个有向图（Directed Graph）中任意两点v1、v2间存在v1到v2的路径（path）及v2到v1的路径。
In 1966, Moon16 proved that the strong tournament is vertex pancyclic firstly.
在有向图方面,1966年Moon16首先证明了强连通竞赛图是顶点泛圈的。
参考来源 - 几乎正则多部竞赛图的Hamilton性和有向图中几个计数问题·2,447,543篇论文数据，部分数据来源于NoteExpress
算法的关键是判断一个结点是否是强连通分量的根。
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 strongly connected components form the subtrees of the search tree, the roots of which are the roots of the strongly connected components.
应用推荐