'''simple docstring'''


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

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


def 					_lowerCamelCase    (      lowerCamelCase_					:							dict	,     lowerCamelCase_					:							int	,     lowerCamelCase_					:							list   ):



     """simple docstring"""





     UpperCAmelCase_							:   Union[str, Any]   =      True
     UpperCAmelCase_							:   int   =      []

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

     return [vert, *connected_verts]


def 					_lowerCamelCase    (      lowerCamelCase_					:							dict   ):



     """simple docstring"""





     UpperCAmelCase_							:   int   =      len(_a   )
     UpperCAmelCase_							:   Tuple   =      graph_size * [False]
     UpperCAmelCase_							:   Optional[Any]   =      []

     for i in range(_a   ):
          if not visited[i]:
               UpperCAmelCase_							:   int   =      dfs(_a	,     _a	,     _a   )
               components_list.append(_a   )

     return components_list


if __name__ == "__main__":
 import doctest

 doctest.testmod()














def    lowerCAmelCase__		(			_a				:	int			):
		if not isinstance(_a     ,					_a			):
				snake_case_ :							Optional[int]         =				F'''Input value of [number={number}] must be an integer'''
				raise TypeError(_a			)
		if number < 1:
				raise ValueError("Input must be a positive integer"			)
		return number * (2 * number - 1)


if __name__ == "__main__":
							import doctest

							doctest.testmod()
