先来看看什么是强连通图?
强连通图就是有向图中任意两点都能是互相可达的。
一个有向图可以分成多个子图,如果某个子图内部是强连通的,并且已经扩展到了最大,即该子图中的任意一点不与子图外的任意一点连通,则称这个子图为该有向图的一个强连通分量,简称SCC。
一个常见的问题就是如果就一个有向图的SCC个数?
这两种算法都可以用来解决有向图的强连通分量的个数。
Kosaraju算法
基于DFS的拓扑排序代码:
void dfs1(int x)
{
for(int i = 0; i < a[x].size(); i++){
int v = a[x][i];
if(!vis[v]){
vis[v] = 1;
dfs1(v);
}
}
s.push_back(x);
}
例题:http://acm.hdu.edu.cn/showproblem.php?pid=1269
AC代码:
#include <bits/stdc++.h>
#define ull unsigned long long
#define ll long long
const int inf = 0x3f3f3f3f;
const int mod = 998244353;
const int N = 10005;
const ll ds = 1e15+7;
//const double p1 = 3.141592653589793238462643383;
using namespace std;
int n,m;
int vis[N],sccno[N],cnt;
vector<int>a[N],b[N],s;
void dfs1(int x)
{
for(int i = 0; i < a[x].size(); i++){
int v = a[x][i];
if(!vis[v]){
vis[v] = 1;
dfs1(v);
}
}
s.push_back(x);
}
void dfs2(int x)
{
for(int i = 0; i < b[x].size(); i++){
int v = b[x][i];
if(!sccno[v]){
sccno[v] = cnt;
dfs2(v);
}
}
}
void Kosaraju()
{
for(int i = 1; i <= n; i++){
if(!vis[i]) {
vis[i] = 1;
dfs1(i);
}
}
for(int i = s.size()-1; i >= 0; i--){
if(!sccno[s[i]]){
sccno[s[i]] = ++cnt;
dfs2(s[i]);
}
}
}
void solve()
{
cnt = 0;
for(int i = 1; i <= m; i++){
int u,v;
scanf("%d%d",&u,&v);
a[u].push_back(v);
b[v].push_back(u);
}
Kosaraju();
cnt == 1 ? puts("Yes") : puts("No");
}
int main()
{
while(~scanf("%d%d",&n,&m)){
if(n == 0 && m == 0) break;
memset(vis,0,sizeof(vis));
memset(sccno,0,sizeof(sccno));
for(int i = 0; i <= n; i++) a[i].clear(),b[i].clear();
s.clear();
solve();
}
return 0;
}
Trajan算法
用Trajan算法解决此题
AC代码:
#include <bits/stdc++.h>
#define ull unsigned long long
#define ll long long
const int inf = 0x3f3f3f3f;
const int mod = 998244353;
const int N = 10005;
const ll ds = 1e15+7;
//const double p1 = 3.141592653589793238462643383;
using namespace std;
int n,m;
int vis[N],sccno[N],low[N],num[N],cnt,t,top;
vector<int>a[N];
int st[N];
void dfs(int x)
{
st[top++] = x;
low[x] = num[x] = ++t;
for(int i = 0; i < a[x].size(); i++){
int v = a[x][i];
if(!num[v]){
dfs(v);
low[x] = min(low[v],low[x]);
}
else if(!sccno[v]) low[x] = min(low[x],num[v]);
}
if(low[x] == num[x]){
cnt++;
while(true){
int y = st[--top];
sccno[y] = cnt;
if(y == x) break;
}
}
}
void Trajan()
{
for(int i = 1; i <= n; i++){
if(!num[i]) {
num[i] = 1;
dfs(i);
}
}
}
void solve()
{
cnt = t = top = 0;
for(int i = 1; i <= m; i++){
int u,v;
scanf("%d%d",&u,&v);
a[u].push_back(v);
}
Trajan();
cnt == 1 ? puts("Yes") : puts("No");
}
int main()
{
while(~scanf("%d%d",&n,&m)){
if(n == 0 && m == 0) break;
memset(low,0,sizeof(low));
memset(num,0,sizeof(num));
memset(sccno,0,sizeof(sccno));
for(int i = 0; i <= n; i++) a[i].clear();
solve();
}
return 0;
}