-
Notifications
You must be signed in to change notification settings - Fork 0
/
lab3.cpp
72 lines (62 loc) · 1.7 KB
/
lab3.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
#include <bits/stdc++.h>
using namespace std;
const int n = 6;
bool bfs(int rgraph[n][n],int s, int t, int parent[n]){
int visited[n] = {0};
queue<int>q;
q.push(s);
visited[s] = 1;
parent[s] = -1;
while(!q.empty()){
int u = q.front();
q.pop();
for(int v = 0; v < n; v++){
if(visited[v] == 0 && rgraph[u][v] > 0){
if(v == t){
parent[v] = u;
return true;
}
q.push(v);
visited[v] = 1;
parent[v] = u;
}
}
}
return false;
}
int ford_fulkerson_algo (int G[n][n], int s, int t){
int rgraph[n][n];
for(int u = 0; u < n; u++){
for(int v = 0; v < n; v++){
rgraph[u][v] = G[u][v];
}
}
int parent[n];
int max_flow = 0;
int path_flow ;
while(bfs(rgraph,s,t,parent)){
path_flow = INT_MAX;
for(int v = t; v != s; v = parent[v]){
int u = parent[v];
path_flow = min(path_flow,rgraph[u][v]);
}
for(int v = t; v != s; v = parent[v]){
int u = parent[v];
rgraph[u][v]-=path_flow;
rgraph[v][u]+=path_flow;
}
max_flow+=path_flow;
}
return max_flow;
}
int main() {
int G[n][n] = {{0,16,13,0,0,0},{0,0,10,12,0,0},{0,4,0,0,14,0},{0,0,9,0,0,20},{0,0,0,7,0,4},{0,0,0,0,0,0}};
for(int i = 0; i < n; i++){
for(int j = 0; j < n; j++){
cout<<G[i][j]<<" ";
}
cout<<endl;
}
cout <<"max flow = "<< ford_fulkerson_algo(G,0,5)<<endl;
return 0;
}