We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
https://joke-lin.top/2020/04/06/2020-04-06-connected-components/
简单定义 有向图中称为，强连通分量。连通图和连通分量都是针对无向图。 在有向图G中，如果两个顶点间至少存在一条路径，称两个顶点强连通(strongly connected)。如果有向图G的每两个顶点都强连通，称G是一个强连通图。非强连通图有向图的极大强连通子图，称为强连通分量(strongly connected components)。
The text was updated successfully, but these errors were encountered:
No branches or pull requests
https://joke-lin.top/2020/04/06/2020-04-06-connected-components/
简单定义
有向图中称为，强连通分量。连通图和连通分量都是针对无向图。
在有向图G中，如果两个顶点间至少存在一条路径，称两个顶点强连通(strongly connected)。如果有向图G的每两个顶点都强连通，称G是一个强连通图。非强连通图有向图的极大强连通子图，称为强连通分量(strongly connected components)。
The text was updated successfully, but these errors were encountered: