


__UpperCamelCase							:							str    							=					{0: [1, 2], 1: [0, 3], 2: [0], 3: [1], 4: [5, 6], 5: [4, 6], 6: [4, 5]}

__UpperCamelCase							:							Union[str, Any]    							=					{0: [1, 2, 3], 1: [0, 3], 2: [0], 3: [0, 1], 4: [], 5: []}

def       _a	(					SCREAMING_SNAKE_CASE						:					dict     ,			SCREAMING_SNAKE_CASE						:					int     ,			SCREAMING_SNAKE_CASE						:					list  ):







 """simple docstring"""



 UpperCamelCase__       :     Optional[Any] 							= True
 UpperCamelCase__       :     Optional[int] 							= []

 for neighbour in graph[vert]:
  if not visited[neighbour]:
   connected_verts += dfs(SCREAMING_SNAKE_CASE     ,			SCREAMING_SNAKE_CASE     ,			SCREAMING_SNAKE_CASE  )

 return [vert, *connected_verts]

def       _a	(					SCREAMING_SNAKE_CASE						:					dict  ):







 """simple docstring"""



 UpperCamelCase__       :     Tuple 							= len(SCREAMING_SNAKE_CASE  )
 UpperCamelCase__       :     Union[str, Any] 							= graph_size * [False]
 UpperCamelCase__       :     List[Any] 							= []

 for i in range(SCREAMING_SNAKE_CASE  ):
  if not visited[i]:
   UpperCamelCase__       :     Optional[Any] 							= dfs(SCREAMING_SNAKE_CASE     ,			SCREAMING_SNAKE_CASE     ,			SCREAMING_SNAKE_CASE  )
   components_list.append(SCREAMING_SNAKE_CASE  )

 return components_list


if __name__ == "__main__":
       import doctest

       doctest.testmod()






from hashlib import mda, shaaaa

__UpperCamelCase							:							Dict    							=					(shaaaa, mda)

class    __magic_name__						:


     def __init__(   self				:  Optional[Any]				,						lowerCamelCase__				:  int = 8      )	->   None:





      '''simple docstring'''






      UpperCamelCase__       :     int 							= 0b0
      UpperCamelCase__       :     Optional[int] 							= size


     def   UpperCAmelCase__						(   self				:  Tuple				,						lowerCamelCase__				:  str      )	->   None:





      '''simple docstring'''






      UpperCamelCase__       :     Union[str, Any] 							= self.hash_(lowerCamelCase__      )
      self.bitarray |= h


     def   UpperCAmelCase__						(   self				:  Any				,						lowerCamelCase__				:  str      )	->   bool:





      '''simple docstring'''






      UpperCamelCase__       :     Any 							= self.hash_(lowerCamelCase__      )
      return (h & self.bitarray) == h


     def __contains__(   self				:  Any				,						lowerCamelCase__				:  str      )	->   bool:





      '''simple docstring'''






      return self.exists(lowerCamelCase__      )


     def   UpperCAmelCase__						(   self				:  Union[str, Any]				,						lowerCamelCase__				:  int      )	->   str:





      '''simple docstring'''






      UpperCamelCase__       :     Optional[int] 							= bin(lowerCamelCase__      )[2:]
      return res.zfill(self.size      )


     @property
     def   UpperCAmelCase__						(   self				:  Tuple      )	->   str:





      '''simple docstring'''






      return self.format_bin(self.bitarray      )


     def   UpperCAmelCase__						(   self				:  int				,						lowerCamelCase__				:  str      )	->   int:





      '''simple docstring'''






      UpperCamelCase__       :     Union[str, Any] 							= 0b0
      for func in HASH_FUNCTIONS:
       UpperCamelCase__       :     Optional[Any] 							= (
           int.from_bytes(func(value.encode()      ).digest()				,						'''little'''      ) % self.size
       )
       res |= 2**position
      return res


     def   UpperCAmelCase__						(   self				:  Union[str, Any]				,						lowerCamelCase__				:  str      )	->   str:





      '''simple docstring'''






      return self.format_bin(self.hash_(lowerCamelCase__      )      )


     @property
     def   UpperCAmelCase__						(   self				:  str      )	->   float:





      '''simple docstring'''






      UpperCamelCase__       :     Tuple 							= bin(self.bitarray      ).count('''1'''      )
      return (n_ones / self.size) ** len(lowerCamelCase__      )


