




lowerCAmelCase_					    = [
    [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],
]



def      __lowerCAmelCase			(					UpperCamelCase	,      UpperCamelCase	,      UpperCamelCase	,      UpperCamelCase      )     ->	int:
  # Return True if there is node that has not iterated.
  lowerCAmelCase__				:  List[str]		       =     [False] * len(UpperCamelCase      )
  lowerCAmelCase__				:  int		       =     [s]
  lowerCAmelCase__				:  Dict		       =     True

  while queue:
    lowerCAmelCase__				:  Union[str, Any]		       =     queue.pop(0      )
    for ind in range(len(graph[u]      )      ):
      if visited[ind] is False and graph[u][ind] > 0:
        queue.append(UpperCamelCase      )
        lowerCAmelCase__				:  List[str]		       =     True
        lowerCAmelCase__				:  int		       =     u

  return visited[t]



def      __lowerCAmelCase			(					UpperCamelCase	,      UpperCamelCase	,      UpperCamelCase      )     ->	Optional[Any]:
  lowerCAmelCase__				:  Dict		       =     [-1] * (len(UpperCamelCase      ))
  lowerCAmelCase__				:  Dict		       =     0
  lowerCAmelCase__				:  List[str]		       =     []
  lowerCAmelCase__				:  Tuple		       =     [i[:] for i in graph]  # Record original cut, copy.
  while bfs(UpperCamelCase	,      UpperCamelCase	,      UpperCamelCase	,      UpperCamelCase      ):
    lowerCAmelCase__				:  Optional[Any]		       =     float('''Inf'''      )
    lowerCAmelCase__				:  Optional[Any]		       =     sink

    while s != source:
      # Find the minimum value in select path
      lowerCAmelCase__				:  Optional[Any]		       =     min(UpperCamelCase	,      graph[parent[s]][s]      )
      lowerCAmelCase__				:  Union[str, Any]		       =     parent[s]

    max_flow += path_flow
    lowerCAmelCase__				:  List[str]		       =     sink

    while v != source:
      lowerCAmelCase__				:  Union[str, Any]		       =     parent[v]
      graph[u][v] -= path_flow
      graph[v][u] += path_flow
      lowerCAmelCase__				:  Dict		       =     parent[v]

  for i in range(len(UpperCamelCase      )      ):
    for j in range(len(graph[0]      )      ):
      if graph[i][j] == 0 and temp[i][j] > 0:
        res.append((i, j)      )

  return res


if __name__ == "__main__":
     print(mincut(test_graph, source=0, sink=5))







from collections.abc import Callable






class  _lowerCAmelCase     :

      def __init__(   self      ,				__UpperCAmelCase = None		):
        # Stores actual heap items.
        lowerCAmelCase__				:  list		       =     []
        # Stores indexes of each item for supporting updates and deletion.
        lowerCAmelCase__				:  dict		       =     {}
        # Stores current size of heap.
        lowerCAmelCase__				:  Any		       =     0
        # Stores function used to evaluate the score of an item on which basis ordering
        # will be done.
        lowerCAmelCase__				:  Union[str, Any]		       =     key or (lambda __UpperCAmelCase		: x)

      def 	__magic_name__(   self      ,				__UpperCAmelCase		):
        return int((i - 1) / 2		) if i > 0 else None

      def 	__magic_name__(   self      ,				__UpperCAmelCase		):
        lowerCAmelCase__				:  Optional[Any]		       =     int(2 * i + 1		)
        return left if 0 < left < self.size else None

      def 	__magic_name__(   self      ,				__UpperCAmelCase		):
        lowerCAmelCase__				:  List[str]		       =     int(2 * i + 2		)
        return right if 0 < right < self.size else None

      def 	__magic_name__(   self      ,				__UpperCAmelCase      ,				__UpperCAmelCase		):
        lowerCAmelCase__       ,			lowerCAmelCase__				:  List[str]		       =     (
            self.pos_map[self.arr[j][0]],
            self.pos_map[self.arr[i][0]],
        )
        # Then swap the items in the list.
        lowerCAmelCase__       ,			lowerCAmelCase__				:  Any		       =     self.arr[j], self.arr[i]

      def 	__magic_name__(   self      ,				__UpperCAmelCase      ,				__UpperCAmelCase		):
        return self.arr[i][1] < self.arr[j][1]

      def 	__magic_name__(   self      ,				__UpperCAmelCase		):
        lowerCAmelCase__				:  Optional[int]		       =     self._left(__UpperCAmelCase		)
        lowerCAmelCase__				:  Any		       =     self._right(__UpperCAmelCase		)
        lowerCAmelCase__				:  str		       =     i

        if left is not None and not self._cmp(__UpperCAmelCase      ,				__UpperCAmelCase		):
          lowerCAmelCase__				:  Dict		       =     left
        if right is not None and not self._cmp(__UpperCAmelCase      ,				__UpperCAmelCase		):
          lowerCAmelCase__				:  List[str]		       =     right

        return valid_parent

      def 	__magic_name__(   self      ,				__UpperCAmelCase		):
        lowerCAmelCase__				:  Tuple		       =     self._parent(__UpperCAmelCase		)
        while parent is not None and not self._cmp(__UpperCAmelCase      ,				__UpperCAmelCase		):
          self._swap(__UpperCAmelCase      ,				__UpperCAmelCase		)
          lowerCAmelCase__       ,			lowerCAmelCase__				:  Dict		       =     parent, self._parent(__UpperCAmelCase		)

      def 	__magic_name__(   self      ,				__UpperCAmelCase		):
        lowerCAmelCase__				:  str		       =     self._get_valid_parent(__UpperCAmelCase		)
        while valid_parent != index:
          self._swap(__UpperCAmelCase      ,				__UpperCAmelCase		)
          lowerCAmelCase__       ,			lowerCAmelCase__				:  List[Any]		       =     valid_parent, self._get_valid_parent(__UpperCAmelCase		)

      def 	__magic_name__(   self      ,				__UpperCAmelCase      ,				__UpperCAmelCase		):
        if item not in self.pos_map:
          return
        lowerCAmelCase__				:  Tuple		       =     self.pos_map[item]
        lowerCAmelCase__				:  Any		       =     [item, self.key(__UpperCAmelCase		)]
        # Make sure heap is right in both up and down direction.
        # Ideally only one of them will make any change.
        self._heapify_up(__UpperCAmelCase		)
        self._heapify_down(__UpperCAmelCase		)

      def 	__magic_name__(   self      ,				__UpperCAmelCase		):
        if item not in self.pos_map:
          return
        lowerCAmelCase__				:  Tuple		       =     self.pos_map[item]
        del self.pos_map[item]
        lowerCAmelCase__				:  Tuple		       =     self.arr[self.size - 1]
        lowerCAmelCase__				:  int		       =     index
        self.size -= 1
        # Make sure heap is right in both up and down direction. Ideally only one
        # of them will make any change- so no performance loss in calling both.
        if self.size > index:
          self._heapify_up(__UpperCAmelCase		)
          self._heapify_down(__UpperCAmelCase		)

      def 	__magic_name__(   self      ,				__UpperCAmelCase      ,				__UpperCAmelCase		):
        lowerCAmelCase__				:  Optional[int]		       =     len(self.arr		)
        if arr_len == self.size:
          self.arr.append([item, self.key(__UpperCAmelCase		)]		)
        else:
          lowerCAmelCase__				:  str		       =     [item, self.key(__UpperCAmelCase		)]
        lowerCAmelCase__				:  Optional[Any]		       =     self.size
        self.size += 1
        self._heapify_up(self.size - 1		)

      def 	__magic_name__(   self		):
        return self.arr[0] if self.size else None







      def 	__magic_name__(   self		):
        lowerCAmelCase__				:  int		       =     self.get_top()
        if top_item_tuple:
          self.delete_item(top_item_tuple[0]		)
        return top_item_tuple



def      __lowerCAmelCase			(					)     ->	None:
  pass


if __name__ == "__main__":
     import doctest

     doctest.testmod()

