

'''simple docstring'''





def 				_lowerCAmelCase			(   __magic_name__						:     Optional[int]						)				->  Union[str, Any]:
						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			(   __magic_name__						:     dict[int, list[int]]						)				->  list[tuple[int, int]]:
						lowercase :							Union[str, Any]    		=0
						lowercase :							Tuple    		=len(__magic_name__						)  # No of vertices in graph
						lowercase :							Optional[Any]    		=[0] * n
						lowercase :							List[str]    		=[False] * n

						def dfs(__magic_name__						:     Optional[Any]   , __magic_name__						:     Dict   , __magic_name__						:     int   , __magic_name__						:     Optional[int]						):
												lowercase :							List[str]    		=True
												lowercase :							Union[str, Any]    		=id_
												id_ += 1
												for to in graph[at]:
																		if to == parent:
																								pass
																		elif not visited[to]:
																								dfs(__magic_name__   , __magic_name__   , __magic_name__   , id_						)
																								lowercase :							Dict    		=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
																								lowercase :							Optional[int]    		=min(low[at]   , low[to]						)

						lowercase :							list[tuple[int, int]]    		=[]
						for i in range(__magic_name__						):
												if not visited[i]:
																		dfs(__magic_name__   , -1   , __magic_name__   , id_						)
						return bridges


if __name__ == "__main__":
							import doctest

							doctest.testmod()








'''simple docstring'''





from __future__ import annotations






def 				_lowerCAmelCase			(   __magic_name__						:     list[float]						)				->  float:
						lowercase :							Any    		=0.0_0
						lowercase :							Tuple    		=0
						for resistor in resistors:
												if resistor <= 0:
																		lowercase :							Dict    		=f'''Resistor at index {index} has a negative or zero value!'''
																		raise ValueError(__magic_name__						)
												first_sum += 1 / float(__magic_name__						)
												index += 1
						return 1 / first_sum






def 				_lowerCAmelCase			(   __magic_name__						:     list[float]						)				->  float:
						lowercase :							Optional[Any]    		=0.0_0
						lowercase :							int    		=0
						for resistor in resistors:
												sum_r += resistor
												if resistor < 0:
																		lowercase :							Tuple    		=f'''Resistor at index {index} has a negative value!'''
																		raise ValueError(__magic_name__						)
												index += 1
						return sum_r


if __name__ == "__main__":
							import doctest

							doctest.testmod()





