



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

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


if __name__ == "__main__":
       import doctest

       doctest.testmod()









from graphs.minimum_spanning_tree_kruskal import kruskal



def __lowerCAmelCase	(       ):
			lowercase__   					=			9
			lowercase__   					=			[
			    [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],
			]

			lowercase__   					=			kruskal(SCREAMING_SNAKE_CASE_  ,					SCREAMING_SNAKE_CASE_					)

			lowercase__   					=			[
			    [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_					)




