Flow Problem
Time Limit: 5000/5000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 19048 Accepted Submission(s): 8959
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)
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
23 21 2 12 3 13 31 2 12 3 11 3 1
Sample Output
Case 1: 1Case 2: 2
#include<iostream>
#include<cstring>
#define INF 0x3f3f3f3f
using namespace std;
int mp[30][30],vis[30],n;
int dfs(int u,int low)//递归求出一条增广路径
{
if(u==n) return low;
if(vis[u]) return 0;
vis[u]=1;
for(int i=1;i<=n;i++)
{
int flow;
if(mp[u][i]&&(flow=dfs(i,low>mp[u][i]?mp[u][i]:low)))
{
mp[u][i]-=flow;
mp[i][u]+=flow;
return flow;
}
}
return 0;
}
int main()
{
int t,C=1;
cin>>t;
while(t--)
{
memset(mp,0,sizeof(mp));
memset(vis,0,sizeof(vis));
int m;
cin>>n>>m;
for(int i=0;i<m;i++)
{
int a,b,c;
cin>>a>>b>>c;
mp[a][b]+=c;//此处要注意,防止多重边
}
int maxflow=0,flow;
while(flow=dfs(1,INF))
{
maxflow+=flow;
memset(vis,0,sizeof(vis));
}
cout<<"Case "<<C++<<": "<<maxflow<<endl;
}
}