






'''simple docstring'''


def 						__magic_name__(			_A    ,   _A       ):
						'''simple docstring'''





						UpperCamelCase__       =			(boundary[1] - boundary[0]) / steps
						UpperCamelCase__       =			boundary[0]
						UpperCamelCase__       =			boundary[1]
						UpperCamelCase__       =			make_points(_A    ,   _A    ,   _A       )
						UpperCamelCase__       =			0.0
						y += (h / 3.0) * f(_A       )
						UpperCamelCase__       =			2
						for i in x_i:
												y += (h / 3) * (4 - 2 * (cnt % 2)) * f(_A       )
												cnt += 1
						y += (h / 3.0) * f(_A       )
						return y







def 						__magic_name__(			_A    ,   _A    ,   _A       ):
						'''simple docstring'''





						UpperCamelCase__       =			a + h
						while x < (b - h):
												yield x
												UpperCamelCase__       =			x + h







def 						__magic_name__(			_A       ):  # enter your function here
						'''simple docstring'''





						UpperCamelCase__       =			(x - 0) * (x - 0)
						return y







def 						__magic_name__(			):
						'''simple docstring'''





						UpperCamelCase__       =			0.0  # Lower bound of integration
						UpperCamelCase__       =			1.0  # Upper bound of integration
						UpperCamelCase__       =			1_0.0  # define number of steps or resolution
						UpperCamelCase__       =			[a, b]  # define boundary of integration
						UpperCamelCase__       =			method_a(_A    ,   _A       )
						print(f"y = {y}"       )


if __name__ == "__main__":
					main()








'''simple docstring'''


lowerCamelCase_					:			List[Any]     						=				{0: [1, 2], 1: [0, 3], 2: [0], 3: [1], 4: [5, 6], 5: [4, 6], 6: [4, 5]}

lowerCamelCase_					:			Tuple     						=				{0: [1, 2, 3], 1: [0, 3], 2: [0], 3: [0, 1], 4: [], 5: []}







def 						__magic_name__(			_A    ,   _A    ,   _A       ):
						'''simple docstring'''





						UpperCamelCase__       =			True
						UpperCamelCase__       =			[]

						for neighbour in graph[vert]:
												if not visited[neighbour]:
																		connected_verts += dfs(_A    ,   _A    ,   _A       )

						return [vert, *connected_verts]







def 						__magic_name__(			_A       ):
						'''simple docstring'''





						UpperCamelCase__       =			len(_A       )
						UpperCamelCase__       =			graph_size * [False]
						UpperCamelCase__       =			[]

						for i in range(_A       ):
												if not visited[i]:
																		UpperCamelCase__       =			dfs(_A    ,   _A    ,   _A       )
																		components_list.append(_A       )

						return components_list


if __name__ == "__main__":
					import doctest

					doctest.testmod()
