网络流最大流模板dicnic

#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
#define inf 0x3f3f3f3f
#define MAXN 100
using namespace std;
struct Edge{
	int from,to;
	int cap;
	int flow;
	Edge(int u,int v,int c,int f):from(u),to(v),cap(c),flow(f){
	}
};
vector<Edge>edges;
vector<int>G[MAXN];
int vis[MAXN];
int d[MAXN];
int cur[MAXN];
int m;
int s,t;
void Add_edge(int from,int to,int cap)
{
	edges.push_back(Edge(from,to,cap,0));
	edges.push_back(Edge(to,from,0,0));
	int m=edges.size();
	G[from].push_back(m-2);
	G[to].push_back(m-1);	
}
bool bfs()
{
	memset(vis,0,sizeof(vis));
	queue<int>q;
	q.push(s);
	d[s]=1;
	vis[s]=1;
	while(!q.empty())
	{
		int x=q.front();
		q.pop();
		for(int i=0;i<G[x].size();i++)
		{
			Edge &e=edges[G[x][i]];
			if(!vis[e.to]&&e.cap>e.flow)
			{
				vis[e.to]=1;
				d[e.to]=d[x]+1;
				q.push(e.to);
			} 
		}
		
	}
	return vis[t];
}
int dfs(int x,int a)
{
	if(x==t||a==0)
	return a;
	int flow=0,f;
	for(int &i=cur[x];i<G[x].size();i++)
	{
		Edge &e=edges[G[x][i]];
		if(d[x]+1==d[e.to]&&(f=dfs(e.to,min(a,e.cap-e.flow)))>0)
		{
			e.flow+=f;
			edges[G[x][i]^1].flow-=f;
			flow+=f;
			a-=f;
			if(a==0)
			break;
		}
	}
	return flow;
}
int dicnic()
{
	int ans=0;
	while(bfs())
	{
		memset(cur,0,sizeof(cur));
		ans+=dfs(s,inf);
	}
	return ans;
}
int main()
{
	cin>>m;
	int x,y,z;
	for(int i=0;i<m;i++)
	{
		cin>>x>>y>>z;
		Add_edge(x,y,z);
	}
	cout<<dicnic()<<endl;
	return 0;
}