Data Structure
Networking
RDBMS
Operating System
Java
MS Excel
iOS
HTML
CSS
Android
Python
C Programming
C++
C#
MongoDB
MySQL
Javascript
PHP
Physics
Chemistry
Biology
Mathematics
English
Economics
Psychology
Social Studies
Fashion Studies
Legal Studies
- Selected Reading
- UPSC IAS Exams Notes
- Developer's Best Practices
- Questions and Answers
- Effective Resume Writing
- HR Interview Questions
- Computer Glossary
- Who is Who
C++ Program to Implement Network_Flow Problem
This is a C++ Program to implement Network_Flow problem using Ford Fulkerson algorithm.
Algorithms:
Begin function bfs() returns true if there is path from source s to sink t in the residual graph which indicates additional possible flow in the graph. End Begin function fordfulkarson() return maximum flow in given graph: A) initiate flow as 0. B) If there is an augmenting path from source to sink, add the path to flow. C) Return flow. End
Example Code
#include <iostream>
#include <climits>
#include <cstring>
#include <queue>
#define n 7
using namespace std;
bool bfs(int g[n][n], int s, int t, int par[])
{
bool visit[n];
memset(visit, 0, sizeof(visit));
queue <int> q;
q.push(s);
visit[s] = true;
par[s] = -1;
while (!q.empty())
{
int u = q.front();
q.pop();
for (int v=0; v<n; v++)
{
if (visit[v]==false && g[u][v] > 0)
{
q.push(v);
par[v] = u;
visit[v] = true;
}
}
}
return (visit[t] == true);
}
int fordFulkerson(int G[n][n], int s, int t)
{
int u, v;
int g[n][n];
for (u = 0; u < n; u++)
{
for (v = 0; v < n; v++)
g[u][v] = G[u][v];
}
int par[n];
int max_flow = 0;
while (bfs(g, s, t,par))
{
int path_flow = INT_MAX;
for (v=t; v!=s; v=par[v])
{
u = par[v];
path_flow = min(path_flow, g[u][v]);
}
for (v = t; v != s; v = par[v])
{
u = par[v];
g[u][v] -= path_flow;
g[v][u] += path_flow;
}
max_flow += path_flow;
}
return max_flow;
}
int main()
{
int g[n][n] = {{0, 6, 7, 1},
{0, 0, 4, 2},
{0, 5, 0, 0},
{0, 0, 19, 12},
{0, 0, 0, 17},
{0, 0, 0, 0}};
cout << "The maximum possible flow is " << fordFulkerson(g, 0, 3);
return 0;
}Output
The maximum possible flow is 3
Updated on: 30-Jul-2019
390 Views
Advertisements