abhyudaynj / ford-fulkerson-algorithm

Python implemented Ford Fulkerson Algorithm to find max flow with graphical representation.

ford-fulkerson-algorithm

Python implemented Ford Fulkerson Algorithm to find maximum flow with graphical representation.

Prerequisites

• graphviz
• pydot

Input:

    Graph Name = {
      'node': [ False (visited), [ 'node'(edgeNode), capacity, current-flow ] ] }

  # Example
   graph = {
    'A': [False,['B',10,0],['C',10,0]],
    'B': [False,['D',4,0],['E',8,0]],
    'C': [False,['F',9,0]],
    'D': [False,['F',10,0]],
    'E': [False,['D', 6,0],['F',10,0]],
    'F': [False]
    }

Output: Maximum Flow = 19