





'''simple docstring'''


from graphs.minimum_spanning_tree_kruskal import kruskal
def 							UpperCAmelCase_  (						):
   lowercase_      :List[Any]         =			9
   lowercase_      :Optional[int]         =			[
       [0, 1, 4],
       [0, 7, 8],
       [1, 2, 8],
       [7, 8, 7],
       [7, 6, 1],
       [2, 8, 2],
       [8, 6, 6],
       [2, 3, 7],
       [2, 5, 4],
       [6, 5, 2],
       [3, 5, 14],
       [3, 4, 9],
       [5, 4, 10],
       [1, 7, 11],
   ]

   lowercase_      :Optional[Any]         =			kruskal(__lowerCamelCase     ,__lowerCamelCase			)

   lowercase_      :str         =			[
       [7, 6, 1],
       [2, 8, 2],
       [6, 5, 2],
       [0, 1, 4],
       [2, 5, 4],
       [2, 3, 7],
       [0, 7, 8],
       [3, 4, 9],
   ]

   assert sorted(__lowerCamelCase			) == sorted(__lowerCamelCase			)









'''simple docstring'''


from abc import ABC, abstractmethod
from argparse import ArgumentParser
class 				a_       (    _lowerCAmelCase							):





     @staticmethod
     @abstractmethod
     def 							lowercase__				(			lowercase		: ArgumentParser						):





        """simple docstring"""




        raise NotImplementedError()







     @abstractmethod
     def 							lowercase__				(			self		: str						):





        """simple docstring"""




        raise NotImplementedError()


