






from __future__ import annotations

from cmath import sqrt
def 						_a    (      a :int	,							a :int	,							a :int )							->			tuple[complex, complex]:

 if a == 0:
  raise ValueError('''Coefficient \'a\' must not be zero.''' )
 a		  =      b * b - 4 * a * c

 a		  =      (-b + sqrt(a )) / (2 * a)
 a		  =      (-b - sqrt(a )) / (2 * a)

 return (
     root_a.real if not root_a.imag else root_a,
     root_a.real if not root_a.imag else root_a,
 )
def 						_a    (      )							->			Optional[Any]:
 a  ,     a		  =      quadratic_roots(a=5	,							b=6	,							c=1 )
 print(F"""The solutions are: {solutiona} and {solutiona}""" )


if __name__ == "__main__":
     main()









from collections import defaultdict

from graphs.minimum_spanning_tree_prims import prisms_algorithm as mst





def      lowerCAmelCase_ (       )     ->		Optional[int]:







  """simple docstring"""





  lowerCamelCase__  ,					lowerCamelCase__:      int			  =9, 14  # noqa: F841
  lowerCamelCase__:      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, 14],
      [3, 4, 9],
      [5, 4, 10],
      [1, 7, 11],
  ]

  lowerCamelCase__:      List[str]			  =defaultdict(__a		)
  for nodea, nodea, cost in edges:
    adjancency[nodea].append([nodea, cost]		)
    adjancency[nodea].append([nodea, cost]		)

  lowerCamelCase__:      List[str]			  =mst(__a		)

  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],
  ]

  for answer in expected:
    lowerCamelCase__:      Optional[int]			  =tuple(answer[:2]		)
    lowerCamelCase__:      List[Any]			  =tuple(edge[::-1]		)
    assert edge in result or reverse in result

