code: def dinic_bfs(capacity, flow, level, source, sink):
      """
      BFS function for Dinic algorithm.
      Check whether sink is reachable only using edges that is not full.
      """
      vertices = len(capacity)
      queue = Queue()
      queue.put(source)
      level[source] = 0
      while queue.qsize():
          front = queue.get()
          for nxt in range(vertices):
              if (
                  level[nxt] == -1
                  and flow[front][nxt] < capacity[front][nxt]
              ):
                  level[nxt] = level[front] + 1
                  queue.put(nxt)
      return level[sink] != -1
  
imports: from queue import Queue
label_desc: Use image node_id 4 for calling a global function with example usage: dinic_bfs(capacity, flow, level, source, sink) and returns: unknown