EK
邻接矩阵
int f[maxn][maxn]; //流量
int p[maxn]; //上一个
int a[maxn]; //是否访问
int c[maxn][maxn]; //容量
int n,m;
int maxflow(int s,int t)
{
queue<int> q;
while(!q.empty()) q.pop(); // 清空队列
int flow = 0;
memset(f,0,sizeof(f));
memset(p,0,sizeof(p));
while(1)
{
memset(a,0,sizeof(a));
a[s] = 0x3f3f3f3f;
q.push(s);
while(!q.empty())
{
int u = q.front();
q.pop();
for(int v = 1;v <= m;v++)
{
if(!a[v]&&c[u][v] > f[u][v]) //如果没被访问 并且容量大于流量
{
p[v] = u;
q.push(v);
a[v] = min(a[u],c[u][v] - f[u][v]);//流量为容量和流量中小的
}
}
}
if(a[t] == 0) break;
for(int u = t;u!=s;u=p[u])
{
f[p[u]][u] += a[t];
f[u][p[u]] -= a[t];
}
flow += a[t];
}
return flow;
}
int main()
{
int i,j,k;
int u,v,w;
while(scanf("%d%d",&n,&m) != EOF)
{
memset(c,0,sizeof(c));
for(i=0;i<n;i++)
{
scanf("%d%d%d",&u,&v,&w);
c[u][v] += w; // 建图
}
int ans = maxflow(1,m);
printf("%d\n",ans);
}
return 0;
}
Dinic
邻接表
int s,t;//源点和汇点
int cnt;//边的数量,从0开始编号。
int Head[maxn];//每一个点最后一条边的编号
int Next[maxn];//指向对应点的前一条边
int V[maxn];//每一条边指向的点
int W[maxn];//每一条边的残量
int Depth[maxn];//分层图中标记深度
int n,m;
void Add(int u,int v,int w)
{
cnt++;
Next[cnt] = Head[u];
V[cnt] = v;
W[cnt] = w;
Head[u] = cnt;
}
void Add_edge(int u,int v,int w)
{
Add(u,v,w); //双向图
Add(v,u,0);
}
int dfs(int u,int dist)
{
if(u == t)
return dist;
for(int i = Head[u];i!=-1;i=Next[i])
{
if((Depth[V[i]] == Depth[u]+1)&&W[i] !=0)//层数是当前层数加一流量不为0
{
int di = dfs(V[i],min(dist,W[i]));
if(di > 0)
{
W[i] -= di;
W[i^1] += di;
return di;
}
}
}
Depth[u] = -1;
return 0;
}
bool bfs()
{
queue<int> q;
while(!q.empty()) q.pop();
memset(Depth,0,sizeof(Depth));
Depth[s] = 1;
q.push(s);
do
{
int u = q.front();
q.pop();
for(int i = Head[u];i!=-1;i = Next[i])
{
if((W[i]>0)&&Depth[V[i]] == 0) //存在容量 并且没被访问
{
Depth[V[i]] = Depth[u] + 1; // 层数加一
q.push(V[i]);
}
}
}
while(!q.empty());
if(Depth[t] == 0) return 0;
else return 1;
}
int Dinic()
{
int Ans = 0;
while(bfs()) //建立分层图
{
while(int d = dfs(s,0x3f3f3f3f)) //增广
Ans += d;
}
return Ans;
}
int main()
{
int i,j,k;
int u,v,w;
while(scanf("%d%d",&n,&m) != EOF)
{
cnt=-1; //初始化边的编号
memset(Head,-1,sizeof(Head));
memset(Next,-1,sizeof(Next));
for(i=0;i<n;i++ ) //建图
{
scanf("%d%d%d",&u,&v,&w);
Add_edge(u,v,w);
}
s = 1; // 起点终点
t = m;
int ans = Dinic();
printf("%d\n",ans);
}
return 0;
}
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1000005;
int s,t;//源点和汇点
int cnt;//边的数量,从0开始编号。
int Head[maxn];//每一个点最后一条边的编号
struct node
{
int u,v,w,next;
}edge[10*maxn];
int Depth[maxn];//分层图中标记深度
int n,m;
void Add(int u,int v,int w)
{
cnt++;
edge[cnt].u = u;
edge[cnt].v=v;
edge[cnt].w = w;
edge[cnt].next = Head[u];
Head[u] = cnt;
}
void Add_edge(int u,int v,int w)
{
Add(u,v,w); //双向图
Add(v,u,0);
}
int dfs(int u,int dist)
{
if(u == t)
return dist;
for(int i = Head[u];i!=-1;i=edge[i].next)
{
int v = edge[i].v;
int w = edge[i].w;
if((Depth[v] == Depth[u]+1)&&w !=0)//层数是当前层数加一流量不为0
{
int di = dfs(v,min(dist,w));
if(di > 0)
{
edge[i].w -= di;
edge[i^1].w += di;
return di;
}
}
}
Depth[u] = -1;
return 0;
}
bool bfs()
{
queue<int> q;
while(!q.empty()) q.pop();
memset(Depth,0,sizeof(Depth));
Depth[s] = 1;
q.push(s);
do
{
int u = q.front();
q.pop();
for(int i = Head[u];i!=-1;i = edge[i].next)
{
int v = edge[i].v;
int w = edge[i].w;
if((w>0)&&Depth[v] == 0) //存在容量 并且没被访问
{
Depth[v] = Depth[u] + 1; // 层数加一
q.push(v);
}
}
}
while(!q.empty());
if(Depth[t] == 0) return 0;
else return 1;
}
int Dinic()
{
int Ans = 0;
while(bfs()) //建立分层图
{
// cout<<"YES"<<endl;
while(int d = dfs(s,0x3f3f3f3f)) //增广
Ans += d;
}
return Ans;
}