HDU 3549 Flow Problem 网络流入门

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

题意 ：给出节点数和 各边的容量 求最大流

代码：

#include
#include
#include
using namespace std;
int vis[18];                
int map[18][18];                //该边的可行流
int fa[18];                     //父亲节点
int m;                          
bool bfs()
{
	memset(vis,0,sizeof(vis));
	memset(fa,0,sizeof(fa));           //每次寻找增广路径 重置
	int now;
	queueq;
	vis[1]=1;now=1;
	q.push(now);
	while(!q.empty())
	{
		now=q.front();
		q.pop();
		if(now==m)
			return true;
		for(int next=1;next<=m;next++)
		{
			if(vis[next]==0&&map[now][next]!=0)
			{
				q.push(next);
				vis[next]=1;
				fa[next]=now;           //得到父亲节点
			}
		}
	}
	return false;
}
int max_f()
{
	int i;
	int ans=0;
	int min1=999999;
	while(1)
	{
		if(bfs()==false)
			return ans;
		for( i=m;i!=1;i=fa[i])               //从汇点到源点比较出此路径能增加的最大流
		{
			if(map[fa[i]][i]>t;
	for(int k=1;k<=t;k++)
	{
		memset(map,0,sizeof(map));
		cin>>m>>n;
		while(n--)
		{
			cin>>a>>b>>s;
			map[a][b]+=s;
		}
		cout<<"Case "< 

 网络流第一种算法：Edmonds-Karp算法
 
 
的模板。。。