






'''simple docstring'''




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       __UpperCAmelCase						(  lowerCamelCase_     ,      lowerCamelCase_     ,      lowerCamelCase_     ,      lowerCamelCase_)							->     Union[str, Any]:
		# Return True if there is node that has not iterated.
		UpperCamelCase__				:					List[Any]					=					[False] * len(lowerCamelCase_)
		UpperCamelCase__				:					List[str]					=					[s]
		UpperCamelCase__				:					List[Any]					=					True

		while queue:
				UpperCamelCase__				:					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(lowerCamelCase_)
								UpperCamelCase__				:					Any					=					True
								UpperCamelCase__				:					Dict					=					u

		return visited[t]







def       __UpperCAmelCase						(  lowerCamelCase_     ,      lowerCamelCase_     ,      lowerCamelCase_)							->     Optional[int]:
		UpperCamelCase__				:					Dict					=					[-1] * (len(lowerCamelCase_))
		UpperCamelCase__				:					Optional[Any]					=					0
		UpperCamelCase__				:					Optional[Any]					=					[]
		UpperCamelCase__				:					int					=					[i[:] for i in graph]  # Record original cut, copy.
		while bfs(lowerCamelCase_     ,      lowerCamelCase_     ,      lowerCamelCase_     ,      lowerCamelCase_):
				UpperCamelCase__				:					Tuple					=					float('Inf')
				UpperCamelCase__				:					Any					=					sink

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

				max_flow += path_flow
				UpperCamelCase__				:					Any					=					sink

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

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












'''simple docstring'''




import requests
from bsa import BeautifulSoup







def       __UpperCAmelCase						(  lowerCamelCase_ = "AAPL")							->     str:
		UpperCamelCase__				:					str					=					f'https://in.finance.yahoo.com/quote/{symbol}?s={symbol}'
		UpperCamelCase__				:					Optional[Any]					=					BeautifulSoup(requests.get(lowerCamelCase_).text     ,      'html.parser')
		UpperCamelCase__				:					Union[str, Any]					=					'My(6px) Pos(r) smartphone_Mt(6px)'
		return soup.find('div'     ,      class_=class_).find('span').text


if __name__ == "__main__":
		for symbol in "AAPL AMZN IBM GOOG MSFT ORCL".split():
				print(f'''Current {symbol:<4} stock price is {stock_price(symbol):>8}''')




