"""simple docstring"""
def 				lowerCAmelCase__      (     _UpperCamelCase    :			Union[str, Any]   )   ->			str:





						"""simple docstring"""






						return [
						    {
						        0: [1, 2],
						        1: [0, 2],
						        2: [0, 1, 3, 5],
						        3: [2, 4],
						        4: [3],
						        5: [2, 6, 8],
						        6: [5, 7],
						        7: [6, 8],
						        8: [5, 7],
						    },
						    {
						        0: [6],
						        1: [9],
						        2: [4, 5],
						        3: [4],
						        4: [2, 3],
						        5: [2],
						        6: [0, 7],
						        7: [6],
						        8: [],
						        9: [1],
						    },
						    {
						        0: [4],
						        1: [6],
						        2: [],
						        3: [5, 6, 7],
						        4: [0, 6],
						        5: [3, 8, 9],
						        6: [1, 3, 4, 7],
						        7: [3, 6, 8, 9],
						        8: [5, 7],
						        9: [5, 7],
						    },
						    {
						        0: [1, 3],
						        1: [0, 2, 4],
						        2: [1, 3, 4],
						        3: [0, 2, 4],
						        4: [1, 2, 3],
						    },
						][index]





def 				lowerCAmelCase__      (     _UpperCamelCase    :			dict[int, list[int]]   )   ->			list[tuple[int, int]]:





						"""simple docstring"""






						snake_case        =     0
						snake_case        =     len(_UpperCamelCase   )  # No of vertices in graph
						snake_case        =     [0] * n
						snake_case        =     [False] * n

						def dfs(_UpperCamelCase    :			List[Any]	,     _UpperCamelCase    :			Optional[int]	,     _UpperCamelCase    :			List[str]	,     _UpperCamelCase    :			str   ):
												snake_case        =     True
												snake_case        =     id_
												id_ += 1
												for to in graph[at]:
																		if to == parent:
																								pass
																		elif not visited[to]:
																								dfs(_UpperCamelCase	,     _UpperCamelCase	,     _UpperCamelCase	,     id_   )
																								snake_case        =     min(low[at]	,     low[to]   )
																								if id_ <= low[to]:
																														bridges.append((at, to) if at < to else (to, at)   )
																		else:
																								# This edge is a back edge and cannot be a bridge
																								snake_case        =     min(low[at]	,     low[to]   )

						snake_case        =     []
						for i in range(_UpperCamelCase   ):
												if not visited[i]:
																		dfs(_UpperCamelCase	,     -1	,     _UpperCamelCase	,     id_   )
						return bridges


if __name__ == "__main__":
					import doctest

					doctest.testmod()



"""simple docstring"""
import cmath
import math





def 				lowerCAmelCase__      (     _UpperCamelCase    :			float	,     _UpperCamelCase    :			float	,     _UpperCamelCase    :			float	,     _UpperCamelCase    :			float   )   ->			complex:





						"""simple docstring"""






						snake_case        =     math.radians(_UpperCamelCase   )
						snake_case        =     math.radians(_UpperCamelCase   )

						# Convert voltage and current to rectangular form
						snake_case        =     cmath.rect(_UpperCamelCase	,     _UpperCamelCase   )
						snake_case        =     cmath.rect(_UpperCamelCase	,     _UpperCamelCase   )

						# Calculate apparent power
						return voltage_rect * current_rect


if __name__ == "__main__":
					import doctest

					doctest.testmod()


