以POJ-1236为例子引入(这里涉及了缩点)
链式前向星写法(推荐):
#include<iostream>
#include<algorithm>
#include<cmath>
#include<cstring>
#include<stack>
#include<vector>
#define ll long long
#define rep(i,a,n) for(int i=a;i<=n;i++)
#define per(i,n,a) for(int i=n;i>=a;i--)
#define endl '\n'
#define mem(a) memset(a,0,sizeof(a))
#define IO ios::sync_with_stdio(false);cin.tie(0);
using namespace std;
const int INF=0x3f3f3f3f;
const int mod=1e9+7;
const int maxn=1e5+5;
int dfn[maxn],low[maxn],tot,tott,n,m,ans=INF,vis[maxn],head[maxn];
int id[maxn],cnt;
int in[maxn],out[maxn];
stack<int> s;
struct E{
int to,next;
}edge[maxn<<1];
void add(int u,int v){
edge[tot].to=v;
edge[tot].next=head[u];
head[u]=tot++;
}
void init(){
while(!s.empty()) s.pop();
memset(dfn,0,sizeof(dfn));
memset(low,0,sizeof(low));
memset(head,-1,sizeof(head));
cnt=0,tott=0;
}
void tarjan(int x){
low[x]=dfn[x]=++tott;
s.push(x);vis[x]=1;
for(int i=head[x];i!=-1;i=edge[i].next){
int v=edge[i].to;
if(!dfn[v]){
tarjan(v);
low[x]=min(low[x],low[v]);
}
else if(vis[v]){
low[x]=min(low[x],dfn[v]);
}
}
if(low[x]==dfn[x]){
cnt++;
while(1){
int now=s.top();
s.pop();
vis[now]=0;
id[now]=cnt;
if(now==x) break;
}
}
}
int main()
{
while(cin>>n){
init();
for(int u=1;u<=n;u++){
int v;
while(cin>>v&&v){
add(u,v);
}
}
for(int i=1;i<=n;i++){
if(!dfn[i]) tarjan(i);
}
if(cnt==1){
cout<<"1"<<endl;
cout<<"0"<<endl;
continue;
}
for(int u=1;u<=n;u++){
for(int i=head[u];i!=-1;i=edge[i].next){
int v=edge[i].to;
if(id[u]!=id[v]){
out[id[u]]++;
in[id[v]]++;
}
}
}
ll ans1=0,ans2=0;
for(ll i=1;i<=cnt;i++) if(in[i]==0) ans1++;
cout<<ans1<<endl;
for(ll i=1;i<=cnt;i++) if(out[i]==0) ans2++;
cout<<max(ans1,ans2)<<endl;
}
}
Vector的写法(不推荐,因为vector存图效率低):
#include<iostream>
#include<algorithm>
#include<cmath>
#include<cstring>
#include<stack>
#include<vector>
#define ll long long
#define endl '\n'
#define IO ios::sync_with_stdio(false);cin.tie(0);
using namespace std;
const int INF=0x3f3f3f3f;
const int maxn=2e5+10;
vector<ll> edge[maxn];
ll dfn[maxn],low[maxn],tot,n,m,ans=INF,vis[maxn];
ll id[maxn],cnt;
ll in[maxn],out[maxn];
stack<ll> s;
void init(){
while(!s.empty()) s.pop();
memset(dfn,0,sizeof(dfn));
memset(vis,0,sizeof(vis));
tot=0;cnt=0;
}
void tarjan(ll x){
low[x]=dfn[x]=++tot;
s.push(x);vis[x]=1;
for(ll i=0;i<edge[x].size();i++){
ll v=edge[x][i];
if(!dfn[v]){
tarjan(v);
low[x]=min(low[x],low[v]);
}else if(vis[v]){
low[x]=min(low[x],dfn[v]);
}
}
if(low[x]==dfn[x]){
cnt++;
while(1){
ll now=s.top();
s.pop();
vis[now]=0;
id[now]=cnt;
if(now==x) break;
}
}
}
int main(){
while(cin>>n){
init();
for(ll u=1;u<=n;u++){
ll v;
while(cin>>v&&v){
edge[u].push_back(v);
}
}
for(ll i=1;i<=n;i++){
if(!dfn[i]) tarjan(i);
}
if(cnt==1){
cout<<"1"<<endl;
cout<<"0"<<endl;
continue;
}
for(ll u=1;u<=n;u++){
for(ll i=0;i<edge[u].size();i++){
ll v=edge[u][i];
if(id[u]!=id[v]){
out[id[u]]++;
in[id[v]]++;
}
}
}
ll ans1=0,ans2=0;
for(ll i=1;i<=cnt;i++) if(in[i]==0) ans1++;
cout<<ans1<<endl;
for(ll i=1;i<=cnt;i++) if(out[i]==0) ans2++;
cout<<max(ans1,ans2)<<endl;
}
}
题解:这是一道很好的题目,包含了强连通分量的查找以及将强连通分量缩成DAG的算法。所以做完后,感觉对强连通有了挺深的了解。先构造一个有向图出来,然后求强连通分量,最后找出那些没有入度的强连通,就是问题1的答案。比较出度为0的强连通个数和入度为0的强连通个数,取最大的,即为问题2的答案。(因为要将该DAG变为一个强连通,那么最少连边就考虑吧那些出度零点连一条边到入度零点。所以答案就是在入度零点和出度零点中找最大值)