



'''simple docstring'''


def   SCREAMING_SNAKE_CASE					(					lowercase_     :   Optional[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   SCREAMING_SNAKE_CASE					(					lowercase_     :   dict[int, list[int]]    ):
						lowercase   =				0
						lowercase   =				len(lowercase_    )  # No of vertices in graph
						lowercase   =				[0] * n
						lowercase   =				[False] * n

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

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


if __name__ == "__main__":
						import doctest

						doctest.testmod()



A						=			'\n# Transformers installation\n! pip install transformers datasets\n# To install from source instead of the last release, comment the command above and uncomment the following one.\n# ! pip install git+https://github.com/huggingface/transformers.git\n'

A						=			[{'type': 'code', 'content': INSTALL_CONTENT}]
A						=			{
    '{processor_class}': 'FakeProcessorClass',
    '{model_class}': 'FakeModelClass',
    '{object_class}': 'FakeObjectClass',
}