

from __future__ import annotations


def 							__lowerCAmelCase     (							_UpperCamelCase		:	float		,				_UpperCamelCase		:	float		,				_UpperCamelCase		:	float						)		->				dict[str, float]:
 '''simple docstring'''


 if (voltage, current, resistance).count(0						) != 1:
  raise ValueError('One and only one argument must be 0'						)
 if resistance < 0:
  raise ValueError('Resistance cannot be negative'						)
 if voltage == 0:
  return {"voltage": float(current * resistance						)}
 elif current == 0:
  return {"current": voltage / resistance}
 elif resistance == 0:
  return {"resistance": voltage / current}
 else:
  raise ValueError('Exactly one argument must be 0'						)


if __name__ == "__main__":
      import doctest

      doctest.testmod()




from graphs.minimum_spanning_tree_kruskal import kruskal


def 							__lowerCAmelCase     (							)		->				Optional[Any]:
 '''simple docstring'''


 SCREAMING_SNAKE_CASE		    =      9
 SCREAMING_SNAKE_CASE		    =      [
     [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],
 ]

 SCREAMING_SNAKE_CASE		    =      kruskal(_UpperCamelCase		,				_UpperCamelCase						)

 SCREAMING_SNAKE_CASE		    =      [
     [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						)

