网络流（dinic算法）

最新推荐文章于 2024-01-23 22:27:41 发布

DASEason

最新推荐文章于 2024-01-23 22:27:41 发布

阅读量1.9k

点赞数

分类专栏：图论文章标签： dinic 网络流

本文链接：https://blog.csdn.net/qq547276542/article/details/47803857

版权

图论专栏收录该内容

20 篇文章 2 订阅

订阅专栏

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <complex>
#include <cstdlib>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <stack>
#include <queue>
using namespace std;
const int maxn=50050;
const int INF=0x7fffffff;
#define M 11
#define LL long long
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 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,0,sizeof(vis));
   queue<int> Q;
   Q.push(s);
   d[s]=0;
   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;
 }
  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){
   this->s=s;this->t=t;
   int flow=0;
   while(BFS()){
    memset(cur,0,sizeof(cur));
    flow+=DFS(s,INF);
   }return flow;
 }
};