


"""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 			A__		(					_UpperCAmelCase    :      dict				,    _UpperCAmelCase    :      int				,    _UpperCAmelCase    :      list	)							->	int:

	'''simple docstring'''


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

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

	return [vert, *connected_verts]



def 			A__		(					_UpperCAmelCase    :      dict	)							->	Optional[int]:

	'''simple docstring'''


	snake_case__  :						Tuple		=      len(a__	)
	snake_case__  :						List[Any]		=      graph_size * [False]
	snake_case__  :						List[str]		=      []

	for i in range(a__	):
		if not visited[i]:
			snake_case__  :						Optional[int]		=      dfs(a__				,    a__				,    a__	)
			components_list.append(a__	)

	return components_list


if __name__ == "__main__":
					import doctest

					doctest.testmod()











'''simple docstring'''
def 							snake_case_    (  a__						:      int     ):



    """simple docstring"""




    __lowercase     							=		1
    __lowercase     							=		0
    __lowercase     							=		1
    __lowercase     							=		1
    __lowercase     							=		3
    __lowercase     							=		3
    __lowercase     							=		limit
    __lowercase     							=		0

    __lowercase     							=		""""""
    while counter != decimal + 1:
        if 4 * q + r - t < n * t:
            result += str(a__     )
            if counter == 0:
                result += "."

            if decimal == counter:
                break

            counter += 1
            __lowercase     							=		10 * (r - n * t)
            __lowercase     							=		((10 * (3 * q + r)) // t) - 10 * n
            q *= 10
            __lowercase     							=		nr
        else:
            __lowercase     							=		(2 * q + r) * l
            __lowercase     							=		(q * (7 * k) + 2 + (r * l)) // (t * l)
            q *= k
            t *= l
            l += 2
            k += 1
            __lowercase     							=		nn
            __lowercase     							=		nr
    return result
def 							snake_case_    (  ):



    """simple docstring"""




    print(f'{calculate_pi(50     ) = }'     )
    import doctest

    doctest.testmod()


if __name__ == "__main__":
  main()




