


from graphs.minimum_spanning_tree_kruskal import kruskal







def        lowerCAmelCase_  (      ):
       __snake_case	:    List[str]											=     9
       __snake_case	:    List[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, 1_4],
           [3, 4, 9],
           [5, 4, 1_0],
           [1, 7, 1_1],
       ]

       __snake_case	:    int											=     kruskal(_SCREAMING_SNAKE_CASE							,			_SCREAMING_SNAKE_CASE			)

       __snake_case	:    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(_SCREAMING_SNAKE_CASE			) == sorted(_SCREAMING_SNAKE_CASE			)





def        lowerCAmelCase_  (      __lowerCamelCase							,			__lowerCamelCase			):
							return int((input_a, input_a).count(0			) == 0			)







def        lowerCAmelCase_  (      ):
							assert and_gate(0							,			0			) == 0
							assert and_gate(0							,			1			) == 0
							assert and_gate(1							,			0			) == 0
							assert and_gate(1							,			1			) == 1


if __name__ == "__main__":
			test_and_gate()
			print(and_gate(1, 0))
			print(and_gate(0, 0))
			print(and_gate(0, 1))
			print(and_gate(1, 1))

