求最大流dinic算法模板

//最短增广路，Dinic算法
struct Edge
{
    int from,to,cap,flow;
};//弧度 

void AddEdge(int from,int to,int cap)  //增弧
{
    edges.push_back((Edge){from,to,cap,});
    edges.push_back((Edge){to,from,,});
    m=edges.size();
    G[from].push_back(m-);
    G[to].push_back(m-);
}

struct Dinic{
    int n,m,s,t;
    vector<Edge> edges;
    vector<int> G[maxn];
    bool vis[maxn];
    int d[maxn];
    int cur[maxn]; 

    bool Bfs()   //构建分层网络
    {
        memset(vis,,sizeof(vis));
        queue<int> Q;
        Q.push(s);
        d[s]=;
        vis[s]=;
        while(!Q.empty())
        {
            int x=Q.front();
                Q.pop();
            for(int i=;i<G[x].size();i++)
            Edge& e=edges[G[x][i]];
            if(!vis[e.to]&&e.cap>e.flow)
            {
                vis[e.to]=;
                d[e.to]=d[x]+;
                Q.push(e.to);
            }
        }
        return vis[t];
    }
};

int DFS(int x,int a)//沿阻塞流增广
{
    if(x==t||a==)
    return a;
    int flow=,f;
    for(int& i=cur[x];i<G[x].size();i++)
    {
        Edge& e=edges[G[x][i]];
        if(d[x]+==d[e.to]&&(f=DFS(e.to,min(a,e.cap-e.flow)))>)
        {
            e.flow+=f;
            edges[G[x][i]^].flow-=f;
            flow+=f;
            a-=f;
            if(a==)
            break;
        }
    }
    return flow;
}

int Maxflow(int s,int t)
{
    this->s=;
    this->t=t;
    int flow=;
    while(BFS())
    {
        memset(cur,,sizeof(cur));
        flow+=DFS(s,inf);
    }
    return flow;
}