


'''simple docstring'''
from graphs.minimum_spanning_tree_kruskal import kruskal





def    a__			(   )       ->      Optional[int]:
    UpperCAmelCase__     :						List[str]						=							9
    UpperCAmelCase__     :						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],
    ]

    UpperCAmelCase__     :						Dict						=							kruskal(lowerCAmelCase__    ,   lowerCAmelCase__		)

    UpperCAmelCase__     :						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(lowerCAmelCase__		) == sorted(lowerCAmelCase__		)





'''simple docstring'''





from __future__ import annotations




def 							lowerCamelCase	(					_snake_case	:    list[int]							):





    '''simple docstring'''


    return len(set(_snake_case							)							) == len(_snake_case							)


if __name__ == "__main__":
 import doctest

 doctest.testmod()




