


'''simple docstring'''







from __future__ import annotations

from typing import Any







def _UpperCamelCase       (     __A    )							->		None:


      '''simple docstring'''



      create_state_space_tree(__A      ,			[]      ,			0    )







def _UpperCamelCase       (     __A      ,			__A      ,			__A    )							->		None:


      '''simple docstring'''



      if index == len(__A    ):
            print(__A    )
            return

      create_state_space_tree(__A      ,			__A      ,			index + 1    )
      current_subsequence.append(sequence[index]    )
      create_state_space_tree(__A      ,			__A      ,			index + 1    )
      current_subsequence.pop()


if __name__ == "__main__":
  a__  :					list[Any]        =       [3, 1, 2, 4]
  generate_all_subsequences(seq)

  seq.clear()
  seq.extend(['A', 'B', 'C'])
  generate_all_subsequences(seq)











lowerCamelCase				:		Tuple     =   [
    [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 			_SCREAMING_SNAKE_CASE			(							lowercase	:       Optional[Any]	,							lowercase	:       int	,							lowercase	:       Optional[Any]	,							lowercase	:       List[Any]     ):


      '''simple docstring'''



      lowerCamelCase_		     =    [False] * len(lowercase     )
      lowerCamelCase_		     =    [s]
      lowerCamelCase_		     =    True

      while queue:
            lowerCamelCase_		     =    queue.pop(0     )
            for ind in range(len(graph[u]     )     ):
                  if visited[ind] is False and graph[u][ind] > 0:
                        queue.append(lowercase     )
                        lowerCamelCase_		     =    True
                        lowerCamelCase_		     =    u

      return visited[t]

def 			_SCREAMING_SNAKE_CASE			(							lowercase	:       List[str]	,							lowercase	:       Tuple	,							lowercase	:       Tuple     ):


      '''simple docstring'''



      lowerCamelCase_		     =    [-1] * (len(lowercase     ))
      lowerCamelCase_		     =    0
      lowerCamelCase_		     =    []
      lowerCamelCase_		     =    [i[:] for i in graph]  # Record original cut, copy.
      while bfs(lowercase	,							lowercase	,							lowercase	,							lowercase     ):
            lowerCamelCase_		     =    float('Inf'     )
            lowerCamelCase_		     =    sink

            while s != source:
                  # Find the minimum value in select path
                  lowerCamelCase_		     =    min(lowercase	,							graph[parent[s]][s]     )
                  lowerCamelCase_		     =    parent[s]

            max_flow += path_flow
            lowerCamelCase_		     =    sink

            while v != source:
                  lowerCamelCase_		     =    parent[v]
                  graph[u][v] -= path_flow
                  graph[v][u] += path_flow
                  lowerCamelCase_		     =    parent[v]

      for i in range(len(lowercase     )     ):
            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))



