


from __future__ import annotations

from cmath import sqrt


def     lowercase	(    a     , a     , a ):



		'''simple docstring'''




		if a == 0:
				raise ValueError("Coefficient 'a' must not be zero." )
		SCREAMING_SNAKE_CASE_				:List[Any]				     =						b * b - 4 * a * c

		SCREAMING_SNAKE_CASE_				:List[str]				     =						(-b + sqrt(a )) / (2 * a)
		SCREAMING_SNAKE_CASE_				:int				     =						(-b - sqrt(a )) / (2 * a)

		return (
		    root_a.real if not root_a.imag else root_a,
		    root_a.real if not root_a.imag else root_a,
		)


def     lowercase	(    ):



		'''simple docstring'''




		SCREAMING_SNAKE_CASE_     ,				SCREAMING_SNAKE_CASE_				:Union[str, Any]				     =						quadratic_roots(a=5     , b=6     , c=1 )
		print(F"The solutions are: {solutiona} and {solutiona}" )


if __name__ == "__main__":
		main()










def     lowercase	(    a     , a     , a     , a ):



		'''simple docstring'''




		SCREAMING_SNAKE_CASE_				:int				     =						[False] * len(a )
		SCREAMING_SNAKE_CASE_				:List[Any]				     =						[]
		queue.append(a )
		SCREAMING_SNAKE_CASE_				:int				     =						True

		while queue:
				SCREAMING_SNAKE_CASE_				:int				     =						queue.pop(0 )
				for ind in range(len(graph[u] ) ):
						if visited[ind] is False and graph[u][ind] > 0:
								queue.append(a )
								SCREAMING_SNAKE_CASE_				:Tuple				     =						True
								SCREAMING_SNAKE_CASE_				:Optional[int]				     =						u

		return visited[t]


def     lowercase	(    a     , a     , a ):



		'''simple docstring'''




		SCREAMING_SNAKE_CASE_				:Any				     =						[-1] * (len(a ))
		SCREAMING_SNAKE_CASE_				:Tuple				     =						0
		while bfs(a     , a     , a     , a ):
				SCREAMING_SNAKE_CASE_				:List[Any]				     =						float("Inf" )
				SCREAMING_SNAKE_CASE_				:str				     =						sink

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

				max_flow += path_flow
				SCREAMING_SNAKE_CASE_				:Dict				     =						sink

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


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

SCREAMING_SNAKE_CASE__					,    SCREAMING_SNAKE_CASE__     					=			0, 5
print(ford_fulkerson(graph, source, sink))






