





def        __lowerCamelCase (							__a       :List[str]   )		->    Optional[Any]:






		"""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 (							__a       :dict[int, list[int]]   )		->    list[tuple[int, int]]:






		"""simple docstring"""

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

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

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


if __name__ == "__main__":
					import doctest

					doctest.testmod()










def        __lowerCamelCase (							__a       :float   ,					__a       :list[float]   )		->    float:






		"""simple docstring"""

		if discount_rate < 0:
				raise ValueError("""Discount rate cannot be negative"""   )
		if not cash_flows:
				raise ValueError("""Cash flows list cannot be empty"""   )
		A__  				=       sum(
		    cash_flow / ((1 + discount_rate) ** i) for i, cash_flow in enumerate(__a   )   )
		return round(__a   ,					ndigits=2   )


if __name__ == "__main__":
					import doctest

					doctest.testmod()



