

"""simple docstring"""





from graphs.minimum_spanning_tree_kruskal import kruskal

def   __SCREAMING_SNAKE_CASE  (      ):
	lowerCAmelCase__	:						Optional[Any]  				=	9
	lowerCAmelCase__	:						Any  				=	[
	    [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__	:						Optional[int]  				=	kruskal(A_						,     A_ )

	lowerCAmelCase__	:						List[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(A_ ) == sorted(A_ )










def    A						(__A   :    list   ,				__A   :    int   ,				__A   :    int = 0   ,				__A   :    int = 0       )   ->      int:







     """simple docstring"""


     UpperCAmelCase_          =							right or len(__A       ) - 1
     if left > right:
          return -1
     elif list_data[left] == key:
          return left
     elif list_data[right] == key:
          return right
     else:
          return search(__A   ,				__A   ,				left + 1   ,				right - 1       )


if __name__ == "__main__":
    import doctest

    doctest.testmod()






