




"""simple docstring"""





def 		lowerCAmelCase				(			lowerCamelCase		):
						'''simple docstring'''


						return int(lowerCamelCase		) if x - int(lowerCamelCase		) <= 0 else int(lowerCamelCase		) + 1


if __name__ == "__main__":
							import doctest

							doctest.testmod()








"""simple docstring"""





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

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

def 		lowerCAmelCase				(			lowerCamelCase   ,      lowerCamelCase   ,      lowerCamelCase		):
						'''simple docstring'''


						snake_case__							:       Any				      =       True
						snake_case__							:       int				      =       []

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

						return [vert, *connected_verts]

def 		lowerCAmelCase				(			lowerCamelCase		):
						'''simple docstring'''


						snake_case__							:       Optional[int]				      =       len(lowerCamelCase		)
						snake_case__							:       str				      =       graph_size * [False]
						snake_case__							:       List[str]				      =       []

						for i in range(lowerCamelCase		):
												if not visited[i]:
																		snake_case__							:       Dict				      =       dfs(lowerCamelCase   ,      lowerCamelCase   ,      lowerCamelCase		)
																		components_list.append(lowerCamelCase		)

						return components_list


if __name__ == "__main__":
							import doctest

							doctest.testmod()


