"""simple docstring"""



def 	_lowerCamelCase			(			UpperCAmelCase__       )				->  set:


   '''simple docstring'''


   a__  					=		set()
   # edges = list of graph's edges
   a__  					=		get_edges(lowercase_       )

   # While there are still elements in edges list, take an arbitrary edge
   # (from_node, to_node) and add his extremity to chosen_vertices and then
   # remove all arcs adjacent to the from_node and to_node
   while edges:
      a__  					=		edges.pop()
      chosen_vertices.add(lowercase_       )
      chosen_vertices.add(lowercase_       )
      for edge in edges.copy():
         if from_node in edge or to_node in edge:
            edges.discard(lowercase_       )
   return chosen_vertices





def 	_lowerCamelCase			(			UpperCAmelCase__       )				->  set:


   '''simple docstring'''


   a__  					=		set()
   for from_node, to_nodes in graph.items():
      for to_node in to_nodes:
         edges.add((from_node, to_node)       )
   return edges


if __name__ == "__main__":
     import doctest

     doctest.testmod()

     # graph = {0: [1, 3], 1: [0, 3], 2: [0, 3, 4], 3: [0, 1, 2], 4: [2, 3]}
     # print(f"Matching vertex cover:\n{matching_min_vertex_cover(graph)}")




def 		UpperCamelCase						(   lowercase_ )		->						float:


  '''simple docstring'''






  if not nums:  # Makes sure that the list is not empty
    raise ValueError("""List is empty""" )

  lowercase__	: int     		=   sum(lowercase_ ) / len(lowercase_ )  # Calculate the average
  return sum(abs(x - average ) for x in nums ) / len(lowercase_ )


if __name__ == "__main__":
     import doctest

     doctest.testmod()






