



from graphs.minimum_spanning_tree_kruskal import kruskal


def 			UpperCamelCase(  ):
		lowerCAmelCase_			:     Tuple									= 9
		lowerCAmelCase_			:     Tuple									= [
		    [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],
		]

		lowerCAmelCase_			:     List[Any]									= kruskal(__UpperCamelCase     ,__UpperCamelCase )

		lowerCAmelCase_			:     Union[str, Any]									= [
		    [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(__UpperCamelCase ) == sorted(__UpperCamelCase )










A__  :  Any								=					'''Tobias Carryer'''

from time import time



class 				__snake_case						:




							def __init__(       self     :       Any				,				A_     :       Tuple				,				A_     :       Dict				,				A_     :       Tuple				,				A_     :       str=int(time())):  # noqa: B008
									lowerCAmelCase_			:     int									= multiplier
									lowerCAmelCase_			:     int									= increment
									lowerCAmelCase_			:     str									= modulo
									lowerCAmelCase_			:     str									= seed







							def    UpperCAmelCase__			(       self     :       int):
									lowerCAmelCase_			:     Optional[int]									= (self.multiplier * self.seed + self.increment) % self.modulo
									return self.seed


if __name__ == "__main__":
						# Show the LCG in action.
						A__  :  Union[str, Any]								=					LinearCongruentialGenerator(166_4525, 10_1390_4223, 2 << 31)
						while True:
												print(lcg.next_number())





