



snake_case__					:     List[str]    		=   [
    [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    snake_case_				(    _SCREAMING_SNAKE_CASE  ,	_SCREAMING_SNAKE_CASE  ,	_SCREAMING_SNAKE_CASE  ,	_SCREAMING_SNAKE_CASE   ):
	# Return True if there is node that has not iterated.
	__lowercase		       =			[False] * len(_SCREAMING_SNAKE_CASE   )
	__lowercase		       =			[s]
	__lowercase		       =			True

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

	return visited[t]



def    snake_case_				(    _SCREAMING_SNAKE_CASE  ,	_SCREAMING_SNAKE_CASE  ,	_SCREAMING_SNAKE_CASE   ):
	__lowercase		       =			[-1] * (len(_SCREAMING_SNAKE_CASE   ))
	__lowercase		       =			0
	__lowercase		       =			[]
	__lowercase		       =			[i[:] for i in graph]  # Record original cut, copy.
	while bfs(_SCREAMING_SNAKE_CASE  ,	_SCREAMING_SNAKE_CASE  ,	_SCREAMING_SNAKE_CASE  ,	_SCREAMING_SNAKE_CASE   ):
		__lowercase		       =			float("Inf"   )
		__lowercase		       =			sink

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

		max_flow += path_flow
		__lowercase		       =			sink

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

	for i in range(len(_SCREAMING_SNAKE_CASE   )   ):
		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 __future__ import annotations

from typing import Any

class   _A   :


						'''simple docstring'''





						def __init__(	self	:							Union[str, Any]							,      lowerCamelCase	:							int	):






							'''simple docstring'''



							__lowercase		       =			num_of_nodes
							__lowercase		       =			[]
							__lowercase		       =			{}



						def     _snake_case	(	self	:							Dict							,      lowerCamelCase	:							int							,      lowerCamelCase	:							int							,      lowerCamelCase	:							int	):






							'''simple docstring'''



							self.m_edges.append([u_node, v_node, weight]	)



						def     _snake_case	(	self	:							List[Any]							,      lowerCamelCase	:							int	):






							'''simple docstring'''



							if self.m_component[u_node] == u_node:
								return u_node
							return self.find_component(self.m_component[u_node]	)



						def     _snake_case	(	self	:							Union[str, Any]							,      lowerCamelCase	:							int	):






							'''simple docstring'''



							if self.m_component[u_node] != u_node:
								for k in self.m_component:
									__lowercase		       =			self.find_component(lowerCamelCase	)



						def     _snake_case	(	self	:							Union[str, Any]							,      lowerCamelCase	:							list[int]							,      lowerCamelCase	:							int							,      lowerCamelCase	:							int	):






							'''simple docstring'''



							if component_size[u_node] <= component_size[v_node]:
								__lowercase		       =			v_node
								component_size[v_node] += component_size[u_node]
								self.set_component(lowerCamelCase	)

							elif component_size[u_node] >= component_size[v_node]:
								__lowercase		       =			self.find_component(lowerCamelCase	)
								component_size[u_node] += component_size[v_node]
								self.set_component(lowerCamelCase	)



						def     _snake_case	(	self	:							Any	):






							'''simple docstring'''



							__lowercase		       =			[]
							__lowercase		       =			0

							__lowercase		       =			[-1] * self.m_num_of_nodes

							# A list of components (initialized to all of the nodes)
							for node in range(self.m_num_of_nodes	):
								self.m_component.update({node: node}	)
								component_size.append(1	)

							__lowercase		       =			self.m_num_of_nodes

							while num_of_components > 1:
								for edge in self.m_edges:
									__lowercase       ,    __lowercase       ,    __lowercase		       =			edge

									__lowercase		       =			self.m_component[u]
									__lowercase		       =			self.m_component[v]

									if u_component != v_component:

										for component in (u_component, v_component):
											if (
											    minimum_weight_edge[component] == -1
											    or minimum_weight_edge[component][2] > w
											):
												__lowercase		       =			[u, v, w]

								for edge in minimum_weight_edge:
									if isinstance(lowerCamelCase							,      lowerCamelCase	):
										__lowercase       ,    __lowercase       ,    __lowercase		       =			edge

										__lowercase		       =			self.m_component[u]
										__lowercase		       =			self.m_component[v]

										if u_component != v_component:
											mst_weight += w
											self.union(lowerCamelCase							,      lowerCamelCase							,      lowerCamelCase	)
											print(f"""Added edge [{u} - {v}]\nAdded weight: {w}\n"""	)
											num_of_components -= 1

								__lowercase		       =			[-1] * self.m_num_of_nodes
							print(f"""The total weight of the minimal spanning tree is: {mst_weight}"""	)



def    snake_case_				(    ):
	pass


if __name__ == "__main__":
	import doctest

	doctest.testmod()



