EK算法模板

#include<cstdio>

#include<cstring>

#include<queue>

#include<algorithm>

using namespace std;

#define maxn 10007

#define min(a,b) a<b?a:b 

int n,capacities[maxn][maxn],s,e,pre[maxn];

void clear()

{

memset(capacities,0,sizeof(int));

memset(pre,0,sizeof(int));

}

int dfs(int src,int des)

{

int minn;

queue<int> Q;

while(!Q.empty())Q.pop();

for(int i=1;i<=n;i++) pre[i]=-1;

Q.push(src),pre[src]=0;

while(!Q.empty())

{

int now=Q.front();

Q.pop();

if(now==des) break;

for(int i=1;i<=n;i++)

if(capacities[now][i]>0&&i!=now&&pre[i]==-1)

minn=min(minn,capacities[now][i]),Q.push(i),pre[i]=now;

}

if(pre[des]==-1) return 0;

return minn;

}

int maxflow(int src,int des)

{

int increment=0,total=0;

while(increment=dfs(src,des)!=0)

{

int k=pre[des],t=des;

while(k)

{

capacities[k][t]+=increment;

capacities[t][k]-=increment;

t=k,k=pre[k];

}

total+=increment;

}

return total;

}

int main()

{

int m,temp1,temp2,ll;

clear();

scanf("%d%d%d",&n,&s,&e);

for(int i=1;i<=m;i++)

{

scanf("%d%d%d",&temp1,&temp2,&ll);

if(temp1==temp2) continue;

capacities[temp1][temp2]+=ll;

capacities[temp2][temp1]-=ll;

}

printf("%d\n",maxflow);

}

转载于:https://www.cnblogs.com/OcahIBye/p/6698840.html