code: def ford_fulkerson(capacity, source, sink):
      """
      Computes maximum flow from source to sink using DFS.
      Time Complexity : O(Ef)
      E is the number of edges and f is the maximum flow in the graph.
      """
      vertices = len(capacity)
      ret = 0
      flow = [[0] * vertices for _ in range(vertices)]
      while True:
          visit = [False for _ in range(vertices)]
          tmp = dfs(capacity, flow, visit, vertices, source, sink)
          if tmp:
              ret += tmp
          else:
              break
      return ret
  
imports: from queue import Queue
label_desc: Use image node_id 2 for calling a global function with example usage: ford_fulkerson(capacity, source, sink) and returns: ret