HDU 3549 Flow Problem【最大流模板题,EK算法】

本文详细介绍了一道经典的网络流问题——EdmondKarp算法入门题,并提供了完整的AC代码实现。通过对样例输入输出的解析,帮助读者理解如何求解加权有向图的最大流问题。

摘要生成于 C知道 ,由 DeepSeek-R1 满血版支持, 前往体验 >

Flow Problem

Time Limit: 5000/5000 MS (Java/Others)    Memory Limit: 65535/32768 K (Java/Others)
Total Submission(s): 13814    Accepted Submission(s): 6589


Problem Description
Network flow is a well-known difficult problem for ACMers. Given a graph, your task is to find out the maximum flow for the weighted directed graph.
 

Input
The first line of input contains an integer T, denoting the number of test cases.
For each test case, the first line contains two integers N and M, denoting the number of vertexes and edges in the graph. (2 <= N <= 15, 0 <= M <= 1000)
Next M lines, each line contains three integers X, Y and C, there is an edge from X to Y and the capacity of it is C. (1 <= X, Y <= N, 1 <= C <= 1000)
 

Output
For each test cases, you should output the maximum flow from source 1 to sink N.
 

Sample Input
  
2 3 2 1 2 1 2 3 1 3 3 1 2 1 2 3 1 1 3 1
 

Sample Output
  
Case 1: 1 Case 2: 2
 

Author
HyperHexagon
 

Source

原题链接:http://acm.hdu.edu.cn/showproblem.php?pid=3549

EdmondKarp算法入门题。

AC代码:

/**
  * 行有余力,则来刷题!
  * 博客链接:http://blog.csdn.net/hurmishine
  *
*/

#include <iostream>
#include <cstdio>
#include <cstring>
#include <queue>
using namespace std;
const int maxn=15+5;
const int INF=1e9;
int a[maxn][maxn];
bool vis[maxn];
int pre[maxn];
int n,m;
int s,t;
bool BFS()
{
    queue<int>q;
    memset(pre,-1,sizeof(pre));
    memset(vis,false,sizeof(vis));

    pre[s]=s;
    vis[s]=true;
    q.push(s);
    while(!q.empty())
    {
        int p=q.front();
        q.pop();
        for(int i=1; i<=n; i++)
        {
            if(a[p][i]>0&&!vis[i])
            {
                pre[i]=p;
                vis[i]=true;
                if(i==t)
                    return true;
                q.push(i);
            }
        }
    }
    return false;
}
int EdmondKarp()
{
    int ans=0;
    while(BFS())
    {
        int minn=INF;
        for(int i=t; i!=s; i=pre[i])
            minn=min(minn,a[pre[i]][i]);
        for(int i=t; i!=s; i=pre[i])
        {
            a[pre[i]][i]-=minn;
            a[i][pre[i]]+=minn;
        }
        ans+=minn;
    }
    return ans;
}
int main()
{
    //freopen("data.txt","r",stdin);
    int T,kase=0;;
    cin>>T;
    while(T--)
    {
        cin>>n>>m;
        memset(a,0,sizeof(a));
        int x,y,z;
        while(m--)
        {
            cin>>x>>y>>z;
            a[x][y]+=z;
        }
        s=1,t=n;
        printf("Case %d: %d\n",++kase,EdmondKarp());

    }
    return 0;
}

尊重原创,转载请注明出处:http://blog.csdn.net/hurmishine


评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值