


def        UpperCAmelCase__	(lowerCAmelCase_  ,						lowerCAmelCase_  ,						lowerCAmelCase_  ,						lowerCAmelCase_       ):




					'''simple docstring'''


					__SCREAMING_SNAKE_CASE						       =    [False] * len(__lowerCamelCase       )
					__SCREAMING_SNAKE_CASE						       =    []
					queue.append(__lowerCamelCase       )
					__SCREAMING_SNAKE_CASE						       =    True

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

					return visited[t]




def        UpperCAmelCase__	(lowerCAmelCase_  ,						lowerCAmelCase_  ,						lowerCAmelCase_       ):




					'''simple docstring'''


					__SCREAMING_SNAKE_CASE						       =    [-1] * (len(__lowerCamelCase       ))
					__SCREAMING_SNAKE_CASE						       =    0
					while bfs(__lowerCamelCase  ,						__lowerCamelCase  ,						__lowerCamelCase  ,						__lowerCamelCase       ):
										__SCREAMING_SNAKE_CASE						       =    float("Inf"       )
										__SCREAMING_SNAKE_CASE						       =    sink

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

										max_flow += path_flow
										__SCREAMING_SNAKE_CASE						       =    sink

										while v != source:
															__SCREAMING_SNAKE_CASE						       =    parent[v]
															graph[u][v] -= path_flow
															graph[v][u] += path_flow
															__SCREAMING_SNAKE_CASE						       =    parent[v]
					return max_flow


a__    :							str            =					[
    [0, 1_6, 1_3, 0, 0, 0],
    [0, 0, 1_0, 1_2, 0, 0],
    [0, 4, 0, 0, 1_4, 0],
    [0, 0, 9, 0, 0, 2_0],
    [0, 0, 0, 7, 0, 4],
    [0, 0, 0, 0, 0, 0],
]

a__      ,					a__    :							List[Any]            =					0, 5



print(ford_fulkerson(graph, source, sink))




"""simple docstring"""







def        UpperCAmelCase__	(lowerCAmelCase_  ,						lowerCAmelCase_       ):




					'''simple docstring'''


					if digit_amount > 0:
										return round(number - int(lowerCAmelCase_       )  ,						lowerCAmelCase_       )
					return number - int(lowerCAmelCase_       )


if __name__ == "__main__":
		print(decimal_isolate(1.53, 0))
		print(decimal_isolate(35.3_45, 1))
		print(decimal_isolate(35.3_45, 2))
		print(decimal_isolate(35.3_45, 3))
		print(decimal_isolate(-14.7_89, 3))
		print(decimal_isolate(0, 2))
		print(decimal_isolate(-14.1_23, 1))
		print(decimal_isolate(-14.1_23, 2))
		print(decimal_isolate(-14.1_23, 3))
