ACM学习-最大网络流

// ACM学习-最大网络流.cpp : 定义控制台应用程序的入口点。
//总体是通过一次一次迭代，每次迭代，首先建立一个空队列，再把
//源点加进去，从源点出发找到由它出发的边组成的链表的头，遍历该链表
//如果链表中的边的容量没有到达上限且目的点没有被访问过，我们就把它加入
//队列中，且记下该点前缀，依次从队列中取元素直到队列为空，或者到达终点
#include "stdafx.h"
#include<iostream>
#include<stack>
using namespace std;
const int v = 7;
int neighbour[v][v] = {
//   s      1      2      3     4       5      t
{-10000,    20,     9,-10000,-10000,-10000,-10000},//s
{-10000,-10000,    16,     7,    10,-10000,-10000},//1
{-10000,-10000,-10000,     5,-10000,    10,-10000},//2
{-10000,-10000,-10000,-10000,-10000,     8,-10000},//3
{-10000,-10000,-10000,     6,-10000,     8,    15},//4
{-10000,-10000,-10000,-10000,-10000,-10000,    13},//5
{-10000,-10000,-10000,-10000,-10000,-10000,-10000},//t
};
struct Edge{
int dest=-1;
Edge*link=nullptr;
};
Edge edge[v];


int find_path(int n,int s,int t,int*pre){
int*q = new int[n];
int*mark = new int[n];
memset(mark,0,sizeof(int)*n);
Edge *l;
int qt, qh, i, x;
for (q[0] = s, qt = 0, qh = 1, mark[s] = 1; qt < qh; qt++){
x = q[qt];
l = &edge[x];
while (l){
if (neighbour[x][l->dest]>0&& mark[l->dest] == 0){
mark[l->dest] = 1;
pre[l->dest] = x;
if (l->dest == t)return 1;
q[qh++] = l->dest;
}
l = l->link;
}

}
delete[] mark;
return 0;


}
bool find_path1(int n, int s, int t, stack<int>& sk){
int* mark = new int[n];
Edge *l;
memset(mark, 0, sizeof(int)*n);
sk.push(s);
mark[s] = 1;
while (!sk.empty()){
int temp = sk.top();
l = &edge[temp];
int findPoint = -1;
while (l)
{
if (mark[l->dest] == 0 && l->dest != -1 && neighbour[temp][l->dest]>0){
mark[l->dest] = 1;
findPoint = l->dest;
if (findPoint == t){
return true;
}
}
l = l->link;
}
if (findPoint != -1){
sk.push(findPoint);
}
else{
sk.pop();
}
}
return false;


}
int Ford_Fulkerson1(int n, int s, int t, int&F){
int i, min;
stack<int> sk;
int*pre = new int[n];
if (!find_path1(n, s, t, sk)){

return 0;
}
min = 10000;
int temp_t = t;
while (!sk.empty()){
if (neighbour[sk.top()][temp_t] < min){
min = neighbour[sk.top()][temp_t];
}
pre[temp_t] = sk.top();
temp_t = sk.top();
sk.pop();
}
for (i = t; i != s; i = pre[i]){
if (neighbour[pre[i]][i] < min){
min = neighbour[pre[i]][i];
}
}
for (int i = t; i != s; i = pre[i]){


neighbour[pre[i]][i] -= min;
neighbour[i][pre[i]] += min;


}


F += min;
delete[]pre;
return 1;
}
int Ford_Fulkerson(int n, int s, int t, int&F){
int i, min;
int*pre = new int[n];
if (find_path(n, s, t, pre)==0){
delete[]pre;
return 0;
}
//cout << "dd" << endl;
min = 10000;
for (i = t; i != s; i = pre[i]){
if (neighbour[pre[i]][i] < min){
min = neighbour[pre[i]][i];
}
}
for (int i = t; i != s; i = pre[i]){

neighbour[pre[i]][i] -= min;
neighbour[i][pre[i]] += min;

}

F += min;
delete[]pre;
return 1;
}
int _tmain(int argc, _TCHAR* argv[])
{
for(int i = 0; i < v; i++)
for (int j=0; j < v; j++){
if (neighbour[i][j]>0)
{
if (edge[i].dest == -1){
edge[i].dest = j;
}
else{
Edge*head = &edge[i];
while (head->link != nullptr)
{
head = head->link;
}
Edge*temp = new Edge;
temp->dest = j;
head->link = temp;
}



}
}
/*for (int i = 0; i < v; i++){

if (edge[i].dest != -1){
Edge*head = &edge[i];
while (head!= nullptr){
cout << i << " :" << head->dest << ends;
head = head->link;
}
}
cout << endl;
}*/
int F = 0;
while (Ford_Fulkerson1(v,0,6,F));
cout << "max=" << F << endl;
return 0;
}