{"id":26369,"date":"2017-10-26T21:53:55","date_gmt":"2017-10-26T16:23:55","guid":{"rendered":"https:\/\/www.wikitechy.com\/technology\/?p=26369"},"modified":"2017-10-26T21:53:55","modified_gmt":"2017-10-26T16:23:55","slug":"c-algorithm-ford-fulkerson-algorithm-maximum-flow-problem","status":"publish","type":"post","link":"https:\/\/www.wikitechy.com\/technology\/c-algorithm-ford-fulkerson-algorithm-maximum-flow-problem\/","title":{"rendered":"Cpp Algorithm – Ford-Fulkerson Algorithm for Maximum Flow Problem"},"content":{"rendered":"

Given a graph which represents a flow network where every edge has a capacity. Also given two vertices source <\/em>\u2018s\u2019 and sink<\/em> \u2018t\u2019 in the graph, find the maximum possible flow from s to t with following constraints:<\/span><\/p>\n

a)<\/strong> Flow on an edge doesn\u2019t exceed the given capacity of the edge.<\/p>\n

b)<\/strong> Incoming flow is equal to outgoing flow for every vertex except s and t.<\/p>\n

For example, consider the following graph from CLRS book.<\/p>\n

The maximum possible flow in the above graph is 23.<\/p>\n

Prerequisite : Max Flow Problem Introduction<\/strong><\/p>\n

Ford-Fulkerson Algorithm<\/strong> \r\nThe following is simple idea of Ford-Fulkerson algorithm:\r\n1)<\/strong> Start with initial flow as 0.\r\n2) <\/strong>While there is a augmenting path from source to sink. \r\n           Add this path-flow to flow.\r\n3) <\/strong>Return flow.<\/pre>\n
Time Complexity:<\/strong> Time complexity of the above algorithm is O(max_flow * E). We run a loop while there is an augmenting path. In worst case, we may add 1 unit flow in every iteration. Therefore the time complexity becomes O(max_flow * E).<\/p>\n[ad type=”banner”]\n
How to implement the above simple algorithm? <\/strong>
\nLet us first define the concept of Residual Graph which is needed for understanding the implementation.
\nResidual Graph<\/strong><\/em> of a flow network is a graph which indicates additional possible flow. If there is a path from source to sink in residual graph, then it is possible to add flow. Every edge of a residual graph has a value called residual capacity<\/em><\/strong> which is equal to original capacity of the edge minus current flow. Residual capacity is basically the current capacity of the edge.
\nLet us now talk about implementation details. Residual capacity is 0 if there is no edge between two vertices of residual graph. We can initialize the residual graph as original graph as there is no initial flow and initially residual capacity is equal to original capacity. To find an augmenting path, we can either do a BFS or DFS of the residual graph. We have used BFS in below implementation. Using BFS, we can find out if there is a path from source to sink. BFS also builds parent[] array. Using the parent[] array, we traverse through the found path and find possible flow through this path by finding minimum residual capacity along the path. We later add the found path flow to overall flow.
\nThe important thing is, we need to update residual capacities in the residual graph. We subtract path flow from all edges along the path and we add path flow along the reverse edges We need to add path flow along reverse edges because may later need to send flow in reverse direction (See following link for example).<\/p>\n
Following are C++ and Java implementations of Ford-Fulkerson algorithm. To keep things simple, graph is represented as a 2D matrix.<\/p>\n
C++ Programming:<\/strong><\/p>\n
 
 <\/div> 
\/\/ C++ program for implementation of Ford Fulkerson algorithm#include <iostream>#include <limits.h>#include <string.h>#include <queue>using namespace std; \/\/ Number of vertices in given graph#define V 6 \/* Returns true if there is a path from source 's' to sink 't' in  residual graph. Also fills parent[] to store the path *\/bool bfs(int rGraph[V][V], int s, int t, int parent[]){    \/\/ Create a visited array and mark all vertices as not visited    bool visited[V];    memset(visited, 0, sizeof(visited));     \/\/ Create a queue, enqueue source vertex and mark source vertex    \/\/ as visited    queue <int> q;    q.push(s);    visited[s] = true;    parent[s] = -1;     \/\/ Standard BFS Loop    while (!q.empty())    {        int u = q.front();        q.pop();         for (int v=0; v<V; v++)        {            if (visited[v]==false && rGraph[u][v] > 0)            {                q.push(v);                parent[v] = u;                visited[v] = true;            }        }    }     \/\/ If we reached sink in BFS starting from source, then return    \/\/ true, else false    return (visited[t] == true);} \/\/ Returns the maximum flow from s to t in the given graphint fordFulkerson(int graph[V][V], int s, int t){    int u, v;     \/\/ Create a residual graph and fill the residual graph with    \/\/ given capacities in the original graph as residual capacities    \/\/ in residual graph    int rGraph[V][V]; \/\/ Residual graph where rGraph[i][j] indicates                      \/\/ residual capacity of edge from i to j (if there                     \/\/ is an edge. If rGraph[i][j] is 0, then there is not)      for (u = 0; u < V; u++)        for (v = 0; v < V; v++)             rGraph[u][v] = graph[u][v];     int parent[V];  \/\/ This array is filled by BFS and to store path     int max_flow = 0;  \/\/ There is no flow initially     \/\/ Augment the flow while tere is path from source to sink    while (bfs(rGraph, s, t, parent))    {        \/\/ Find minimum residual capacity of the edges along the        \/\/ path filled by BFS. Or we can say find the maximum flow        \/\/ through the path found.        int path_flow = INT_MAX;        for (v=t; v!=s; v=parent[v])        {            u = parent[v];            path_flow = min(path_flow, rGraph[u][v]);        }         \/\/ update residual capacities of the edges and reverse edges        \/\/ along the path        for (v=t; v != s; v=parent[v])        {            u = parent[v];            rGraph[u][v] -= path_flow;            rGraph[v][u] += path_flow;        }         \/\/ Add path flow to overall flow        max_flow += path_flow;    }     \/\/ Return the overall flow    return max_flow;} \/\/ Driver program to test above functionsint main(){    \/\/ Let us create a graph shown in the above example    int graph[V][V] = { {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}                      };     cout << "The maximum possible flow is " << fordFulkerson(graph, 0, 5);     return 0;}<\/code><\/pre> <\/div>\n
Output:<\/strong><\/p>\n
The maximum possible flow is 23<\/pre>\n
The above implementation of Ford Fulkerson Algorithm is called Edmonds-Karp Algorithm<\/a><\/strong>. The idea of Edmonds-Karp is to use BFS in Ford Fulkerson implementation as BFS always picks a path with minimum number of edges. When BFS is used, the worst case time complexity can be reduced to O(VE2<\/sup>). The above implementation uses adjacency matrix representation though where BFS takes O(V2<\/sup>) time, the time complexity of the above implementation is O(EV3<\/sup>) (Refer CLRS book<\/a> for proof of time complexity)<\/p>\n
This is an important problem as it arises in many practical situations. Examples include, maximizing the transportation with given traffic limits, maximizing packet flow in computer networks.<\/p>\n[ad type=”banner”]\n","protected":false},"excerpt":{"rendered":"
C++ Algorithm – Ford-Fulkerson Algorithm for Maximum Flow Problem – Graph Algorithm – Given a graph which represents a flow network where every edge<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[69969,83515,1,73906,78429],"tags":[78588,78589,78596,78595,78587,78594,78592,78590,78591,78593],"class_list":["post-26369","post","type-post","status-publish","format-standard","hentry","category-algorithm","category-c-programming-3","category-coding","category-graph-algorithms","category-maximum-flow","tag-ford-fulkerson-algorithm-c-program","tag-ford-fulkerson-algorithm-example","tag-ford-fulkerson-algorithm-example-pdf","tag-ford-fulkerson-algorithm-geeksforgeeks","tag-ford-fulkerson-algorithm-pseudocode","tag-ford-fulkerson-algorithm-python","tag-ford-fulkerson-example-step-by-step","tag-ford-fulkerson-min-cut","tag-ford-fulkerson-runtime","tag-maximum-flow-problem-example"],"_links":{"self":[{"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/posts\/26369","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/comments?post=26369"}],"version-history":[{"count":0,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/posts\/26369\/revisions"}],"wp:attachment":[{"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/media?parent=26369"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/categories?post=26369"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/tags?post=26369"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}