


from graphs.minimum_spanning_tree_kruskal import kruskal
def        UpperCamelCase_(				)->		Optional[Any]:
			UpperCamelCase__					=       9
			UpperCamelCase__					=       [
			    [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],
			]

			UpperCamelCase__					=       kruskal(_A				,     _A  )

			UpperCamelCase__					=       [
			    [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(_A  ) == sorted(_A  )






from abc import ABC, abstractmethod
from argparse import ArgumentParser







class        lowerCamelCase__	(							UpperCAmelCase      ):






			"""simple docstring"""






			@staticmethod
			@abstractmethod
			def 				snake_case__				(							snake_case     ):

						'''simple docstring'''


						raise NotImplementedError()







			@abstractmethod
			def 				snake_case__				(							self     ):

						'''simple docstring'''


						raise NotImplementedError()


