强连通分量
#include<iostream>
#include<sstream>
#include<string>
#include<queue>
#include<map>
#include<set>
#include<vector>
#include<stack>
#include <utility>
#include<algorithm>
#include<cstdio>
#include<list>
#include<cmath>
#include<cstdlib>
#include<cstring>
#include<iomanip>
#include<time.h>
#define int long long
#define PI acos(-1.0)
#define eps 1e-9
#define lowbit(a) ((a)&-(a))
const int mod = 1e9+7;
using namespace std;
inline int read(){
char c=getchar();int x=0,s=1;
while(c<'0'||c>'9'){if(c=='-')s=-1;c=getchar();}
while(c>='0'&&c<='9'){x=x*10+c-'0';c=getchar();}
return x*s;
}
int qpow(int a,int b){
int ans=1;
while(b){
if(b&1)ans=(ans*a)%mod;
a=(a*a)%mod;
b>>=1;
}
return ans;
}
//#define endl '\n'
const int INF = 0x3f3f3f3f;
const int N = 5e5+10;
const int maxn = 1e3+10;
int n,m;
struct edge{
int next,to;
}e[N];
int head[N],cnt,k,tim,tp;
int dfn[N],low[N],col[N],vis[N],s[N];
void add(int u,int v){
e[++k].to=v;
e[k].next=head[u];
head[u]=k;
}
void tarjan(int u){
dfn[u]=low[u]=++tim; vis[u]=1; s[++tp]=u;
for(int i=head[u];i;i=e[i].next){
int v=e[i].to;
if(!dfn[v]) tarjan(v),low[u]=min(low[u],low[v]);
else if(vis[v]) low[u]=min(low[u],dfn[v]);
}
if(low[u]==dfn[u]){
++cnt;
int x;
do{
x=s[tp--],vis[x]=0,col[x]=cnt;
}while(u!=x);
}
}
signed main(){
std::ios::sync_with_stdio(false);
cin.tie(0),cout.tie(0);
cin>>n>>m;
for(int i=1;i<=m;i++){
int u,v; cin>>u>>v;
add(u,v);
}
for(int i=1;i<=n;i++)
if(!dfn[i]) tarjan(i);
cout<<cnt<<endl;
}
双连通分量
(其实就比强连通多了一行)
#include<iostream>
#include<sstream>
#include<string>
#include<queue>
#include<map>
#include<set>
#include<vector>
#include<stack>
#include <utility>
#include<algorithm>
#include<cstdio>
#include<list>
#include<cmath>
#include<cstdlib>
#include<cstring>
#include<iomanip>
#include<time.h>
#define int long long
#define PI acos(-1.0)
#define eps 1e-9
#define lowbit(a) ((a)&-(a))
const int mod = 1e9+7;
using namespace std;
inline int read(){
char c=getchar();int x=0,s=1;
while(c<'0'||c>'9'){if(c=='-')s=-1;c=getchar();}
while(c>='0'&&c<='9'){x=x*10+c-'0';c=getchar();}
return x*s;
}
int qpow(int a,int b){
int ans=1;
while(b){
if(b&1)ans=(ans*a)%mod;
a=(a*a)%mod;
b>>=1;
}
return ans;
}
//#define endl '\n'
const int INF = 0x3f3f3f3f;
const int N = 5e5+10;
const int maxn = 1e3+10;
int n,m;
struct edge{
int next,to;
}e[N];
int head[N],cnt,k,tim,tp;
int dfn[N],low[N],col[N],vis[N],s[N];
void add(int u,int v){
e[++k].to=v;
e[k].next=head[u];
head[u]=k;
}
void tarjan(int u,int fa){
dfn[u]=low[u]=++tim; vis[u]=1; s[++tp]=u;
for(int i=head[u];i;i=e[i].next){
int v=e[i].to;
if(v==fa)continue;//加上这句求的就是双连通,不加就是强连通
if(!dfn[v]) tarjan(v,u),low[u]=min(low[u],low[v]);
else if(vis[v]) low[u]=min(low[u],dfn[v]);
}
if(low[u]==dfn[u]){
++cnt;
int x;
do{
x=s[tp--],vis[x]=0,col[x]=cnt;
}while(u!=x);
}
}
signed main(){
std::ios::sync_with_stdio(false);
cin.tie(0),cout.tie(0);
cin>>n>>m;
for(int i=1;i<=m;i++){
int u,v; cin>>u>>v;
add(u,v); add(v,u);
}
for(int i=1;i<=n;i++)
if(!dfn[i]) tarjan(i,i);
cout<<cnt<<endl;
}
桥
#include<iostream>
#include<sstream>
#include<string>
#include<queue>
#include<map>
#include<set>
#include<vector>
#include<stack>
#include <utility>
#include<algorithm>
#include<cstdio>
#include<list>
#include<cmath>
#include<cstdlib>
#include<cstring>
#include<iomanip>
#include<time.h>
#define int long long
#define PI acos(-1.0)
#define eps 1e-9
#define lowbit(a) ((a)&-(a))
const int mod = 1e9+7;
using namespace std;
inline int read(){
char c=getchar();int x=0,s=1;
while(c<'0'||c>'9'){if(c=='-')s=-1;c=getchar();}
while(c>='0'&&c<='9'){x=x*10+c-'0';c=getchar();}
return x*s;
}
int qpow(int a,int b){
int ans=1;
while(b){
if(b&1)ans=(ans*a)%mod;
a=(a*a)%mod;
b>>=1;
}
return ans;
}
//#define endl '\n'
const int INF = 0x3f3f3f3f;
const int N = 5e5+10;
const int maxn = 1e3+10;
int n,m;
struct edge{
int next,to,cut;
}e[N];
int head[N],k,tim,cnt;
int dfn[N],low[N],col[N],vis[N];
void add(int u,int v){
e[++k].to=v;
e[k].cut=0;
e[k].next=head[u];
head[u]=k;
}
void tarjan(int u,int fa){
dfn[u]=low[u]=++tim;
for(int i=head[u];i;i=e[i].next){
int v=e[i].to;
if(v==fa)continue;
if(!dfn[v]){
tarjan(v,u);
low[u]=min(low[u],low[v]);
if(dfn[u]<low[v]) e[i].cut=e[i^1].cut=1,cnt++;
}
else low[u]=min(low[u],dfn[v]);
}
}
signed main(){
std::ios::sync_with_stdio(false);
cin.tie(0),cout.tie(0);
cin>>n>>m;
for(int i=1;i<=m;i++){
int u,v; cin>>u>>v;
add(u,v); add(v,u);
}
for(int i=1;i<=n;i++)
if(!dfn[i]) tarjan(i,i);
cout<<cnt<<endl;
for(int i=1;i<=k;i+=2){
if(e[i].cut)cout<<e[i].to<<"->"<<e[i+1].to<<endl;
}
}
割点
#include<iostream>
#include<sstream>
#include<string>
#include<queue>
#include<map>
#include<set>
#include<vector>
#include<stack>
#include <utility>
#include<algorithm>
#include<cstdio>
#include<list>
#include<cmath>
#include<cstdlib>
#include<cstring>
#include<iomanip>
#include<time.h>
#define int long long
#define PI acos(-1.0)
#define eps 1e-9
#define lowbit(a) ((a)&-(a))
const int mod = 1e9+7;
using namespace std;
inline int read(){
char c=getchar();int x=0,s=1;
while(c<'0'||c>'9'){if(c=='-')s=-1;c=getchar();}
while(c>='0'&&c<='9'){x=x*10+c-'0';c=getchar();}
return x*s;
}
int qpow(int a,int b){
int ans=1;
while(b){
if(b&1)ans=(ans*a)%mod;
a=(a*a)%mod;
b>>=1;
}
return ans;
}
//#define endl '\n'
const int INF = 0x3f3f3f3f;
const int N = 5e5+10;
const int maxn = 1e3+10;
int n,m;
struct edge{
int next,to;
}e[N];
int head[N],k,tim,cnt;
int dfn[N],low[N],vis[N];
void add(int u,int v){
e[++k].to=v;
e[k].next=head[u];
head[u]=k;
}
void tarjan(int u,int fa){
dfn[u]=low[u]=++tim;
int child=0;
for(int i=head[u];i;i=e[i].next){
int v=e[i].to;
if(!dfn[v]){
tarjan(v,u);
low[u]=min(low[u],low[v]);
if(low[v]>=dfn[u]&&u!=fa)cnt++,vis[u]=1;
if(u==fa) child++;
}
low[u]=min(low[u],dfn[v]);
}
if(child>=2&&u==fa) cnt++,vis[u]=1;
}
signed main(){
std::ios::sync_with_stdio(false);
cin.tie(0),cout.tie(0);
cin>>n>>m;
for(int i=1;i<=m;i++){
int u,v; cin>>u>>v;
add(u,v); add(v,u);
}
for(int i=1;i<=n;i++)
if(!dfn[i]) tarjan(i,i);
cout<<cnt<<endl;
for(int i=1;i<=n;i++)if(vis[i])cout<<i<<endl;
}