#include<iostream>
#include<queue>
#include<cstring>
using namespace std;
const int maxn=205;
const int inf=0x3f3f3f3f;
int r[maxn][maxn];
bool visit[maxn];
int pre[maxn];
int m,n;
bool bfs(int s,int t)
{
int p;
queue<int > q;
memset(pre,-1,sizeof(pre));
memset(visit,false,sizeof(visit));
pre[s]=s;
visit[s]=true;
q.push(s);
while(!q.empty())
{
p=q.front();
q.pop();
for(int i=1;i<=n;i++)
{
if(r[p][i]>0&&!visit[i])
{
pre[i]=p;
visit[i]=true;
if(i==t) return true;
q.push(i);
}
}
}
return false;
}
int EdmondsKarp(int s,int t)
{
int flow=0,d,i;
while(bfs(s,t))
{
d=inf;
for(i=t;i!=s;i=pre[i])
d=d<r[pre[i]][i]? d:r[pre[i]][i];
for(i=t;i!=s;i=pre[i])
{
r[pre[i]][i]-=d;
r[i][pre[i]]+=d;
}
flow+=d;
}
return flow;
}
int main()
{
cout<<"EdmondsKarp法求最大流"<<endl;
cout<<"请输入m条边,n个节点,若没有则ctrl+c结束运行:"<<endl;
while(scanf("%d%d",&m,&n)!=EOF)
{
cout<<"领接矩阵法,请输入带权值(容量)的边:"<<endl;
int u,v,w;
memset(r,0,sizeof(r));
for(int i=0;i<m;i++)
{
scanf("%d%d%d",&u,&v,&w);
r[u][v]+=w;
}
cout<<"此网络流图的最大流是";
printf("%d\n",EdmondsKarp(1,n));
cout<<'\n'<<"请输入m条边,n个节点,若没有则ctrl+c结束运行:"<<endl;
}
return 0;
}