






'''simple docstring'''







def 				SCREAMING_SNAKE_CASE_ (UpperCamelCase       ,    UpperCamelCase       ,    UpperCamelCase       ,    UpperCamelCase   )   -> Dict:
							# Return True if there is node that has not iterated.
							lowerCamelCase__      :			Dict 						= [False] * len(UpperCamelCase   )
							lowerCamelCase__      :			Optional[int] 						= []
							queue.append(UpperCamelCase   )
							lowerCamelCase__      :			Dict 						= True

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

							return visited[t]





def 				SCREAMING_SNAKE_CASE_ (UpperCamelCase       ,    UpperCamelCase       ,    UpperCamelCase   )   -> Optional[Any]:
							# This array is filled by BFS and to store path
							lowerCamelCase__      :			List[str] 						= [-1] * (len(UpperCamelCase   ))
							lowerCamelCase__      :			str 						= 0
							while bfs(UpperCamelCase       ,    UpperCamelCase       ,    UpperCamelCase       ,    UpperCamelCase   ):
														lowerCamelCase__      :			Dict 						= float("""Inf"""   )
														lowerCamelCase__      :			Union[str, Any] 						= sink

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

														max_flow += path_flow
														lowerCamelCase__      :			Any 						= sink

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


_A			:    Optional[int]					  =[
    [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],
]

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



print(ford_fulkerson(graph, source, sink))









'''simple docstring'''







import sys
import turtle





def 				SCREAMING_SNAKE_CASE_ (UpperCamelCase       ,    UpperCamelCase   )   -> tuple[float, float]:
							return (pa[0] + pa[0]) / 2, (pa[1] + pa[1]) / 2





def 				SCREAMING_SNAKE_CASE_ (UpperCamelCase       ,    UpperCamelCase       ,    UpperCamelCase       ,    UpperCamelCase       ,    )   -> None:
							my_pen.up()
							my_pen.goto(vertexa[0]       ,    vertexa[1]   )
							my_pen.down()
							my_pen.goto(vertexa[0]       ,    vertexa[1]   )
							my_pen.goto(vertexa[0]       ,    vertexa[1]   )
							my_pen.goto(vertexa[0]       ,    vertexa[1]   )

							if depth == 0:
														return

							triangle(UpperCamelCase       ,    get_mid(UpperCamelCase       ,    UpperCamelCase   )       ,    get_mid(UpperCamelCase       ,    UpperCamelCase   )       ,    depth - 1   )
							triangle(UpperCamelCase       ,    get_mid(UpperCamelCase       ,    UpperCamelCase   )       ,    get_mid(UpperCamelCase       ,    UpperCamelCase   )       ,    depth - 1   )
							triangle(UpperCamelCase       ,    get_mid(UpperCamelCase       ,    UpperCamelCase   )       ,    get_mid(UpperCamelCase       ,    UpperCamelCase   )       ,    depth - 1   )


if __name__ == "__main__":
			if len(sys.argv) != 2:
						raise ValueError(
						    '''Correct format for using this script: '''
						    '''python fractals.py <int:depth_for_fractal>'''
						)
			_A			:    Any					  =turtle.Turtle()
			my_pen.ht()
			my_pen.speed(5)
			my_pen.pencolor('''red''')

			_A			:    Dict					  =[(-175, -125), (0, 175), (175, -125)]  # vertices of triangle
			triangle(vertices[0], vertices[1], vertices[2], int(sys.argv[1]))

