






from __future__ import annotations




def      __A					(     _lowercase ):

					'''simple docstring'''







					_A								= 0.00
					_A								= 0
					for resistor in resistors:
										if resistor <= 0:
															_A								= f"""Resistor at index {index} has a negative or zero value!"""
															raise ValueError(snake_case_ )
										first_sum += 1 / float(snake_case_ )
										index += 1
					return 1 / first_sum




def      __A					(     _lowercase ):

					'''simple docstring'''







					_A								= 0.00
					_A								= 0
					for resistor in resistors:
										sum_r += resistor
										if resistor < 0:
															_A								= f"""Resistor at index {index} has a negative value!"""
															raise ValueError(snake_case_ )
										index += 1
					return sum_r


if __name__ == "__main__":
				import doctest

				doctest.testmod()











__A      =				{0: [2, 3], 1: [0], 2: [1], 3: [4], 4: []}

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




def      __A					(     _lowercase					,			_lowercase					,			_lowercase ):

					'''simple docstring'''







					_A								= True
					_A								= []

					for neighbour in graph[vert]:
										if not visited[neighbour]:
															order += topology_sort(_lowercase					,			_lowercase					,			_lowercase )

					order.append(_lowercase )

					return order




def      __A					(     _lowercase					,			_lowercase					,			_lowercase ):

					'''simple docstring'''







					_A								= True
					_A								= [vert]

					for neighbour in reversed_graph[vert]:
										if not visited[neighbour]:
															component += find_components(_lowercase					,			_lowercase					,			_lowercase )

					return component




def      __A					(     _lowercase ):

					'''simple docstring'''







					_A								= len(_lowercase ) * [False]
					_A								= {vert: [] for vert in range(len(_lowercase ) )}

					for vert, neighbours in graph.items():
										for neighbour in neighbours:
															reversed_graph[neighbour].append(_lowercase )

					_A								= []
					for i, was_visited in enumerate(_lowercase ):
										if not was_visited:
															order += topology_sort(_lowercase					,			_lowercase					,			_lowercase )

					_A								= []
					_A								= len(_lowercase ) * [False]

					for i in range(len(_lowercase ) ):
										_A								= order[len(_lowercase ) - i - 1]
										if not visited[vert]:
															_A								= find_components(_lowercase					,			_lowercase					,			_lowercase )
															components_list.append(_lowercase )

					return components_list



