网络流EK算法

F - Flow Problem

Time Limit:5000MS     Memory Limit:32768KB     64bit IO Format:%I64d & %I64u

Submit  Status

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 
     
     

 ：

网络最大流，是用来求从源点到汇点的最大流量，这里的汇点一般为出度为0的点，同理源点为入度为0的点，EK算法经典之处在于，利用BFS不断找出源点到汇点的一条路，利用增光路进行删减流量，利用增光路的特性，简化过程，bfs的作用只有两个，1是传回前驱点，2是找出局部最大流。

#include<stdio.h>
#include<string.h>
#include<queue>
using namespace std;
#define INF 0x7fffffff 
queue<int>Q;
int map[20][20],pre[20];
int bfs(int s,int e){
	int flow[20];
	for(int i=1;i<=e;i++)pre[i] = -1;
	pre[1] = 0;
	while(!Q.empty())Q.pop();
	flow[s] = INF;
	Q.push(s);
	while(!Q.empty()){
		int a= Q.front();
		Q.pop();
		if(a == e)break;
		for(int i=1;i<=e;i++){
			if(map[a][i]>0&&pre[i] == -1){
				Q.push(i);
				flow[i] = min(map[a][i],flow[a]);
				pre[i] = a;
			}
		}
	}
	
	if(pre[e] == -1)return -1;
	else return flow[e];
}
int main(){
	int t,m,n,o=0;
	scanf("%d",&t);
	while(t--){
		int a,b,c;
		int s = 0;
		o++;
		memset(map,0,sizeof(map));
		scanf("%d%d",&n,&m);
		for(int i=0;i<m;i++){		
		scanf("%d%d%d",&a,&b,&c);
		if(a!=b)map[a][b]+=c;
		}
		int flow;
        while((flow = bfs(1,n))!=-1){
        	s+=flow;
        	int k = n;
        	while(k!=1){
	        	int last = pre[k];
	        	map[last][k] -= flow;
	        	map[k][last] += flow;
	        	k = last;
	        }
        }
		printf("Case %d: %d\n",o,s);
	}
}