最大流Dinic模板

</pre><p>//复杂度O（n^2*m）</p><pre name="code" class="cpp">#include<bits/stdc++.h>
using namespace std;
const int maxn=650;
const int INF=0x3f3f3f3f;
struct Edge{
    int from,to,cap,flow;
};
struct Dinic{
    int n,m,s,t;
    vector<Edge>edges;
    vector<int>G[maxn];
    bool vis[maxn];
    int d[maxn];
    int cur[maxn];
    void AddEdge(int from,int to,int cap){
        edges.push_back((Edge){from,to,cap,0});
        edges.push_back((Edge){to,from,0,0});
        m=edges.size();
        G[from].push_back(m-2);
        G[to].push_back(m-1);
    }
    bool BFS(){
        int x,i;
        memset(vis,0,sizeof(vis));
        queue<int>Q;
        Q.push(s);
        d[s]=0;
        vis[s]=1;
        while(!Q.empty()){
            x=Q.front(),Q.pop();
            for(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 Maxflow(int s,int t){
        this->s=s,this->t=t;
        int flow=0;
        while(BFS()){
            memset(cur,0,sizeof(cur));
            flow+= DFS(s,INF);
        }
        return flow;
    }
};
int main(){
    int n,m,ss,tt,i,j,k,a,b,c,res;  
    //n表示n+1个点，源点0，汇点n。m条边（弧），a，b，c分别表示弧尾，弧头，权值（容量）。
    //求最大流。
    while(scanf("%d%d",&n,&m)!=EOF){
        Dinic tmp;
        for(i=0;i<m;i++){
            scanf("%d%d%d",&a,&b,&c);
            tmp.AddEdge(a,b,c);
        }
        res=tmp.Maxflow(0,n);
        printf("%d\n",res);
    }
    return 0;
}

/*
5 7
0 1 10
0 2 10
1 3 4
1 4 8
2 4 9
3 5 10
4 5 10
*/