

"""simple docstring"""


def    a__   (   __SCREAMING_SNAKE_CASE			)     ->     Union[str, Any]:  # noqa: E741
		__lowerCAmelCase:	Union[str, Any]   				=      len(__SCREAMING_SNAKE_CASE			)
		__lowerCAmelCase:	Tuple   				=      0
		__lowerCAmelCase:	List[Any]   				=      [0] * n
		__lowerCAmelCase:	Tuple   				=      [False] * n
		__lowerCAmelCase:	Optional[Any]   				=      [False] * n

		def dfs(__SCREAMING_SNAKE_CASE ,			__SCREAMING_SNAKE_CASE ,			__SCREAMING_SNAKE_CASE ,			__SCREAMING_SNAKE_CASE			):
				if parent == root:
						out_edge_count += 1
				__lowerCAmelCase:	List[Any]   				=      True
				__lowerCAmelCase:	Optional[int]   				=      at

				for to in l[at]:
						if to == parent:
								pass
						elif not visited[to]:
								__lowerCAmelCase:	Dict   				=      dfs(__SCREAMING_SNAKE_CASE ,			__SCREAMING_SNAKE_CASE ,			__SCREAMING_SNAKE_CASE ,			__SCREAMING_SNAKE_CASE			)
								__lowerCAmelCase:	Optional[Any]   				=      min(low[at] ,			low[to]			)

								# AP found via bridge
								if at < low[to]:
										__lowerCAmelCase:	List[str]   				=      True
								# AP found via cycle
								if at == low[to]:
										__lowerCAmelCase:	Optional[int]   				=      True
						else:
								__lowerCAmelCase:	Optional[Any]   				=      min(low[at] ,			__SCREAMING_SNAKE_CASE			)
				return out_edge_count

		for i in range(__SCREAMING_SNAKE_CASE			):
				if not visited[i]:
						__lowerCAmelCase:	List[str]   				=      0
						__lowerCAmelCase:	Any   				=      dfs(__SCREAMING_SNAKE_CASE ,			__SCREAMING_SNAKE_CASE ,			-1 ,			__SCREAMING_SNAKE_CASE			)
						__lowerCAmelCase:	Any   				=      out_edge_count > 1

		for x in range(len(__SCREAMING_SNAKE_CASE			)			):
				if is_art[x] is True:
						print(__SCREAMING_SNAKE_CASE			)


# Adjacency list of graph
__A						       =      {
    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],
}


compute_ap(data)





"""simple docstring"""


from __future__ import annotations

from math import pi






def    a__   (   __SCREAMING_SNAKE_CASE ,			__SCREAMING_SNAKE_CASE ,			__SCREAMING_SNAKE_CASE			)     ->     dict[str, float]:

		if (inductance, frequency, reactance).count(0			) != 1:
				raise ValueError("One and only one argument must be 0"			)
		if inductance < 0:
				raise ValueError("Inductance cannot be negative"			)
		if frequency < 0:
				raise ValueError("Frequency cannot be negative"			)
		if reactance < 0:
				raise ValueError("Inductive reactance cannot be negative"			)
		if inductance == 0:
				return {"inductance": reactance / (2 * pi * frequency)}
		elif frequency == 0:
				return {"frequency": reactance / (2 * pi * inductance)}
		elif reactance == 0:
				return {"reactance": 2 * pi * frequency * inductance}
		else:
				raise ValueError("Exactly one argument must be 0"			)


if __name__ == "__main__":
			import doctest

			doctest.testmod()


