

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

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







def      snake_case__							(  lowerCAmelCase_,       lowerCAmelCase_,       lowerCAmelCase_     ):





     """simple docstring"""







     SCREAMING_SNAKE_CASE 		=True
     SCREAMING_SNAKE_CASE 		=[]

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

     return [vert, *connected_verts]







def      snake_case__							(  lowerCAmelCase_     ):





     """simple docstring"""







     SCREAMING_SNAKE_CASE 		=len(lowerCAmelCase_     )
     SCREAMING_SNAKE_CASE 		=graph_size * [False]
     SCREAMING_SNAKE_CASE 		=[]

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

     return components_list


if __name__ == "__main__":
 import doctest

 doctest.testmod()




import math



class 						a_			:



      """simple docstring"""







      def __init__( self	:				str     ,snake_case	:				List[Any]     ,snake_case	:				Union[str, Any]     ,snake_case	:				Optional[int]							):
           SCREAMING_SNAKE_CASE 		=x
           SCREAMING_SNAKE_CASE 		=y
           SCREAMING_SNAKE_CASE 		=z


      def __repr__( self	:				Any							):
           return f'Point({self.x}, {self.y}, {self.z})'







def      snake_case__							(  lowerCAmelCase_,       lowerCAmelCase_     ):





     """simple docstring"""







     return math.sqrt(abs((b.x - a.x) ** 2 + (b.y - a.y) ** 2 + (b.z - a.z) ** 2     )     )


if __name__ == "__main__":
 import doctest

 doctest.testmod()

