Dinic算法模板 EdmondsKarp模板

EdmondsKarp模板

struct Edge{
    int from,to,cap,flow;
    Edge(int u,int v,int c,int f):from(u),to(v),cap(c),flow(f){}
};

struct EdmondsKarp{
    int n,m;
    vector<Edge> edges;
    vector<int> G[4*maxn];
    int a[4*maxn];
    int p[4*maxn];
    void init(int n){
        this->n=n;
        for(int i=0;i<n;++i) G[i].clear();
        edges.clear();
    }

    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);
    }

    int MaxFlow(int s,int t){
        int flow=0;
        while(true){
            memset(a,0,sizeof(a));
            queue<int> Q;
            Q.push(s);
            a[s]=Inf;
            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(!a[e.to] && e.cap>e.flow){
                        p[e.to]=G[x][i];
                        a[e.to]=min(a[x],e.cap-e.flow);
                        Q.push(e.to);
                    }
                }
                if(a[t]) break;   //到达了t，提前退出
            }
            if(!a[t]) break;   //没有增广路了
            for(int u=t;u!=s;u=edges[p[u]].from){
                edges[p[u]].flow+=a[t];
                edges[p[u]^1].flow-=a[t];
            }
            flow+=a[t];
        }
        return flow;
    }
};

Dinic模板

struct Dinic{
    int n,m;
    vector<Edge> edges;
    vector<int> G[4*maxn];
    int d[4*maxn];

    void init(int n){
        this->n=n;
        for(int i=0;i<n;++i) G[i].clear();
        edges.clear();
    }

    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 s,int t){
        memset(d,-1,sizeof(d));
        queue<int> Q;
        d[s]=0;
        Q.push(s);
        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(d[e.to]<0 && e.cap>e.flow){
                    d[e.to]=d[x]+1;
                    Q.push(e.to);
                    if(e.to==t) return true;
                }
            }
        }
        return d[t]>=0;
    }
    //cur代表现在所在的节点，a代表增加数量
    int DFS(int cur,int t,int a){
        if(cur==t || a==0) return a;
        int flow=0,f;
        for(int i=0;i<G[cur].size();++i){
            Edge &e=edges[G[cur][i]];
            //注意(f=DFS(e.to,t,min(a,e.cap-e.flow)))>0中的括号不要少
            if(d[e.to]==d[cur]+1 && (f=DFS(e.to,t,min(a,e.cap-e.flow)))>0){
                e.flow+=f;
                edges[G[cur][i]^1].flow-=f;
                flow+=f;
                a-=f;
                if(a==0) break;
            }
        }
        return flow;
    }

    int MaxFlow(int s,int t){
        int flow=0;
        while(BFS(s,t)){
            flow+=DFS(s,t,Inf);
        }
        return flow;
    }
};

当前弧优化：添加了cur数组

Dinic算法还有优化，这个优化被称为当前弧优化，即每一次dfs增广时不从第一条边开始，而是用一个数组cur记录点u之前循环到了哪一条边，以此来加速
参见：https://www.cnblogs.com/SYCstudio/p/7260613.html

struct Edge{
    int from,to,cap,flow;
    Edge(int from,int to,int cap,int flow):from(from),to(to),cap(cap),flow(flow){}
};

struct Dinic{
    int n,m;
    vector<Edge> edges;
    vector<int> G[maxn];
    int d[maxn];
    int cur[maxn];
    void init(int n){
        this->n=n;
        for(int i=0;i<n;++i) G[i].clear();
        edges.clear();
    }

    void AddEdges(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 s,int t){
        memset(d,-1,sizeof(d));
        d[s]=0;
        queue<int> Q;
        Q.push(s);
        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(e.cap>e.flow && d[e.to]<0){
                    d[e.to]=d[x]+1;
                    Q.push(e.to);
                    if(e.to==t) return true;
                }
            }
        }
        return d[t]>=0;
    }

    int DFS(int x,int t,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]];
            //注意(f=DFS(e.to,t,min(a,e.cap-e.flow)))>0中的括号不要少
            if(d[e.to]==d[x]+1 && (f=DFS(e.to,t,min(a,e.cap-e.flow)))>0){
                flow+=f;
                a-=f;
                e.flow+=f;
                edges[G[x][i]^1].flow-=f;
                if(a==0) return flow;
            }
        }
        return flow;
    }

    int Maxflow(int s,int t){
        int flow=0;
        while(BFS(s,t)) {
            memset(cur,0,sizeof(cur));
            flow += DFS(s, t, Inf);
        }
        return flow;
    }
};