

def 			lowerCamelCase__			(       _a):
	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):
	SCREAMING_SNAKE_CASE :   List[Any]					  =							0
	SCREAMING_SNAKE_CASE :   Union[str, Any]					  =							len(_a)  # No of vertices in graph
	SCREAMING_SNAKE_CASE :   str					  =							[0] * n
	SCREAMING_SNAKE_CASE :   str					  =							[False] * n

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

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


if __name__ == "__main__":
			import doctest

			doctest.testmod()




def 	SCREAMING_SNAKE_CASE_							(	_snake_case	:bytes				)  ->     str:
   return "".join([hex(_snake_case				)[2:].zfill(2				).upper() for byte in list(_snake_case				)]				)

def 	SCREAMING_SNAKE_CASE_							(	_snake_case	:str				)  ->     bytes:
   # Check data validity, following RFC3548
   # https://www.ietf.org/rfc/rfc3548.txt
   if (len(_snake_case				) % 2) != 0:
      raise ValueError(
          '''Base16 encoded data is invalid:
Data does not have an even number of hex digits.'''				)
   # Check the character set - the standard base16 alphabet
   # is uppercase according to RFC3548 section 6
   if not set(_snake_case				) <= set('''0123456789ABCDEF'''				):
      raise ValueError(
          '''Base16 encoded data is invalid:
Data is not uppercase hex or it contains invalid characters.'''				)
   # For every two hexadecimal digits (= a byte), turn it into an integer.
   # Then, string the result together into bytes, and return it.
   return bytes(int(data[i] + data[i + 1]	,   16				) for i in range(0	,   len(_snake_case				)	,   2				)				)


if __name__ == "__main__":
   import doctest

   doctest.testmod()



