思路:回顾了下网络流中最简单暴力的一个方法:Ford-Fulkerson算法。
本文不再讲解具体算法原理,直接上代码(我这里采用的邻接矩阵,希望各位不要学我,还是用邻接表比较稳哦):
#include<set>
#include<map>
#include<queue>
#include<vector>
#include<string>
#include<math.h>
#include<stdio.h>
#include<string.h>
#include<iostream>
#include<algorithm>
#include<functional>
using namespace std;
#define maxn 2005
#define ll long long
#define inf 1e18
int n,m,s,t;//s是源点,t是汇点
ll edges[maxn][maxn];
bool vis[maxn];
ll dfs(int u=s,ll flow=inf){
if(u==t)
return flow;
vis[u]=true;
for(int i=1;i<=n;i++){
ll c;
if(edges[u][i]<=0 || vis[i]) continue;
if((c=dfs(i,min(edges[u][i],flow)))!=-1){
edges[u][i]-=c;
edges[i][u]+=c;
return c;
}
}
return -1;
}
int main(void){
ll ans=0,c;
int x,y,val;
scanf("%d%d%d%d",&n,&m,&s,&t);
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
edges[i][j]=0;
for(int i=1;i<=m;i++){
scanf("%d%d%d",&x,&y,&val);
edges[x][y]+=val;
}
while((c=dfs())!=-1){
memset(vis,0,sizeof(vis));
ans+=c;
}
printf("%lld\n",ans);
return 0;
}
进一步优化,我们采用BFS代替DFS实现FF算法,实质上就是EK算法。
#include<set>
#include<map>
#include<queue>
#include<vector>
#include<string>
#include<math.h>
#include<stdio.h>
#include<string.h>
#include<iostream>
#include<algorithm>
#include<functional>
using namespace std;
#define maxn 2005
#define ll long long
#define inf 1e18
int n,m,s,t;
ll edges[maxn][maxn],last[maxn],flow[maxn];
int bfs(){
memset(last,-1,sizeof(last));
queue<int>q;
q.push(s);
flow[s]=inf;
while(!q.empty()){
int now=q.front();
q.pop();
if(now==t)
break;
for(int i=1;i<=n;i++){
if(edges[now][i]>0 && last[i]==-1){
last[i]=now;
flow[i]=min(flow[now],edges[now][i]);
q.push(i);
}
}
}
return last[t]!=-1;
}
ll EK(){
ll maxFlow=0;
while(bfs()){
maxFlow+=flow[t];
int p=t;
while(p!=s){
edges[last[p]][p]-=flow[t];
edges[p][last[p]]+=flow[t];
p=last[p];
}
}
return maxFlow;
}
int main(void){
int x,y,val;
scanf("%d%d%d%d",&n,&m,&s,&t);
for(int i=1;i<=m;i++){
scanf("%d%d%d",&x,&y,&val);
edges[x][y]+=val;
}
printf("%lld\n",EK());
return 0;
}
Dinic算法(未加当前弧优化)
#include<set>
#include<map>
#include<queue>
#include<vector>
#include<string>
#include<math.h>
#include<stdio.h>
#include<string.h>
#include<iostream>
#include<algorithm>
#include<functional>
using namespace std;
#define maxn 2005
#define ll long long
#define inf 1e18
int n,m,s,t,lv[maxn],cur[maxn];
ll edges[maxn][maxn];
//lv是每个点的层数
bool bfs(){
memset(lv,-1,sizeof(lv));
lv[s]=0;
queue<int>q;
q.push(s);
while(!q.empty()){
int now=q.front();
q.pop();
for(int i=1;i<=n;i++){
if(edges[now][i]>0 && lv[i]==-1){
lv[i]=lv[now]+1;
q.push(i);
}
}
}
return lv[t]!=-1;
}
ll dfs(int p=s,ll flow=inf){
if(p==t)
return flow;
ll mn=flow;
for(int i=1;i<=n && mn;i++){
if(edges[p][i]>0 && lv[i]==lv[p]+1){
ll c=dfs(i,min(edges[p][i],mn));
mn-=c;
edges[p][i]-=c;
edges[i][p]+=c;
}
}
return flow-mn;
}
ll dinic(){
ll maxFlow=0;
while(bfs())
maxFlow+=dfs();
return maxFlow;
}
int main(void){
int x,y,val;
scanf("%d%d%d%d",&n,&m,&s,&t);
for(int i=1;i<=m;i++){
scanf("%d%d%d",&x,&y,&val);
edges[x][y]+=val;
}
printf("%lld\n",dinic());
return 0;
}