'''simple docstring'''
from sklearn.metrics import mean_squared_error

import datasets


a=  '''\
@article{scikit-learn,
 title={Scikit-learn: Machine Learning in {P}ython},
 author={Pedregosa, F. and Varoquaux, G. and Gramfort, A. and Michel, V.
         and Thirion, B. and Grisel, O. and Blondel, M. and Prettenhofer, P.
         and Weiss, R. and Dubourg, V. and Vanderplas, J. and Passos, A. and
         Cournapeau, D. and Brucher, M. and Perrot, M. and Duchesnay, E.},
 journal={Journal of Machine Learning Research},
 volume={12},
 pages={2825--2830},
 year={2011}
}
'''

a=  '''\
Mean Squared Error(MSE) is the average of the square of difference between the predicted
and actual values.
'''


a=  '''
Args:
    predictions: array-like of shape (n_samples,) or (n_samples, n_outputs)
        Estimated target values.
    references: array-like of shape (n_samples,) or (n_samples, n_outputs)
        Ground truth (correct) target values.
    sample_weight: array-like of shape (n_samples,), default=None
        Sample weights.
    multioutput: {"raw_values", "uniform_average"} or array-like of shape (n_outputs,), default="uniform_average"
        Defines aggregating of multiple output values. Array-like value defines weights used to average errors.

        "raw_values" : Returns a full set of errors in case of multioutput input.

        "uniform_average" : Errors of all outputs are averaged with uniform weight.

    squared : bool, default=True
        If True returns MSE value, if False returns RMSE (Root Mean Squared Error) value.

Returns:
    mse : mean squared error.
Examples:

    >>> mse_metric = datasets.load_metric("mse")
    >>> predictions = [2.5, 0.0, 2, 8]
    >>> references = [3, -0.5, 2, 7]
    >>> results = mse_metric.compute(predictions=predictions, references=references)
    >>> print(results)
    {\'mse\': 0.375}
    >>> rmse_result = mse_metric.compute(predictions=predictions, references=references, squared=False)
    >>> print(rmse_result)
    {\'mse\': 0.6123724356957945}

    If you\'re using multi-dimensional lists, then set the config as follows :

    >>> mse_metric = datasets.load_metric("mse", "multilist")
    >>> predictions = [[0.5, 1], [-1, 1], [7, -6]]
    >>> references = [[0, 2], [-1, 2], [8, -5]]
    >>> results = mse_metric.compute(predictions=predictions, references=references)
    >>> print(results)
    {\'mse\': 0.7083333333333334}
    >>> results = mse_metric.compute(predictions=predictions, references=references, multioutput=\'raw_values\')
    >>> print(results) # doctest: +NORMALIZE_WHITESPACE
    {\'mse\': array([0.41666667, 1. ])}
'''






@datasets.utils.file_utils.add_start_docstrings(_DESCRIPTION			,							_KWARGS_DESCRIPTION						)
class 			__lowercase		(						datasets.Metric						):







     """simple docstring"""






     def lowerCAmelCase     (		self    ):
         return datasets.MetricInfo(
             description=_DESCRIPTION     ,			citation=_CITATION     ,			inputs_description=_KWARGS_DESCRIPTION     ,			features=datasets.Features(self._get_feature_types()    )     ,			reference_urls=[
                 'https://scikit-learn.org/stable/modules/generated/sklearn.metrics.mean_squared_error.html'
             ]     ,			)







     def lowerCAmelCase     (		self    ):
         if self.config_name == "multilist":
             return {
                 "predictions": datasets.Sequence(datasets.Value('float'    )    ),
                 "references": datasets.Sequence(datasets.Value('float'    )    ),
             }
         else:
             return {
                 "predictions": datasets.Value('float'    ),
                 "references": datasets.Value('float'    ),
             }







     def lowerCAmelCase     (		self     ,			_lowerCamelCase     ,			_lowerCamelCase     ,			_lowerCamelCase=None     ,			_lowerCamelCase="uniform_average"     ,			_lowerCamelCase=True    ):
         __UpperCamelCase	:	Union[str, Any]		    =  mean_squared_error(
             _lowerCamelCase     ,			_lowerCamelCase     ,			sample_weight=_lowerCamelCase     ,			multioutput=_lowerCamelCase     ,			squared=_lowerCamelCase    )

         return {"mse": mse}




'''simple docstring'''
class 			__lowercase		:







     """simple docstring"""






     def __init__(		self    ):
         __UpperCamelCase	:	Any		    =  0
         __UpperCamelCase	:	Any		    =  0
         __UpperCamelCase	:	Any		    =  {}







     def lowerCAmelCase     (		self     ,			_lowerCamelCase    ):
         if vertex not in self.adjacency:
             __UpperCamelCase	:	Tuple		    =  {}
             self.num_vertices += 1







     def lowerCAmelCase     (		self     ,			_lowerCamelCase     ,			_lowerCamelCase     ,			_lowerCamelCase    ):
         self.add_vertex(_lowerCamelCase    )
         self.add_vertex(_lowerCamelCase    )

         if head == tail:
             return

         __UpperCamelCase	:	List[Any]		    =  weight
         __UpperCamelCase	:	Optional[int]		    =  weight







     def lowerCAmelCase     (		self    ):
         __UpperCamelCase	:	List[str]		    =  self.get_edges()
         for edge in edges:
             __UpperCamelCase    ,					__UpperCamelCase    ,					__UpperCamelCase	:	Optional[int]		    =  edge
             edges.remove((tail, head, weight)    )
         for i in range(len(_lowerCamelCase    )    ):
             __UpperCamelCase	:	Union[str, Any]		    =  list(edges[i]    )

         edges.sort(key=lambda _lowerCamelCase    : e[2]    )
         for i in range(len(_lowerCamelCase    ) - 1    ):
             if edges[i][2] >= edges[i + 1][2]:
                 __UpperCamelCase	:	Optional[int]		    =  edges[i][2] + 1
         for edge in edges:
             __UpperCamelCase    ,					__UpperCamelCase    ,					__UpperCamelCase	:	Optional[int]		    =  edge
             __UpperCamelCase	:	Tuple		    =  weight
             __UpperCamelCase	:	Optional[Any]		    =  weight







     def __str__(		self    ):
         __UpperCamelCase	:	Optional[Any]		    =  ''
         for tail in self.adjacency:
             for head in self.adjacency[tail]:
                 __UpperCamelCase	:	Tuple		    =  self.adjacency[head][tail]
                 string += f"""{head} -> {tail} == {weight}\n"""
         return string.rstrip('\n'    )







     def lowerCAmelCase     (		self    ):
         __UpperCamelCase	:	Any		    =  []
         for tail in self.adjacency:
             for head in self.adjacency[tail]:
                 output.append((tail, head, self.adjacency[head][tail])    )
         return output







     def lowerCAmelCase     (		self    ):
         return self.adjacency.keys()







     @staticmethod
     def lowerCAmelCase     (		_lowerCamelCase=None     ,			_lowerCamelCase=None    ):
         __UpperCamelCase	:	Tuple		    =  Graph()
         if vertices is None:
             __UpperCamelCase	:	List[Any]		    =  []
         if edges is None:
             __UpperCamelCase	:	Optional[int]		    =  []
         for vertex in vertices:
             g.add_vertex(_lowerCamelCase    )
         for edge in edges:
             g.add_edge(*_lowerCamelCase    )
         return g






     class 			__lowercase		:







          """simple docstring"""






          def __init__(		self    ):
              __UpperCamelCase	:	Union[str, Any]		    =  {}
              __UpperCamelCase	:	int		    =  {}







          def __len__(		self    ):
              return len(self.parent    )







          def lowerCAmelCase     (		self     ,			_lowerCamelCase    ):
              if item in self.parent:
                  return self.find(_lowerCamelCase    )

              __UpperCamelCase	:	Optional[Any]		    =  item
              __UpperCamelCase	:	List[str]		    =  0
              return item







          def lowerCAmelCase     (		self     ,			_lowerCamelCase    ):
              if item not in self.parent:
                  return self.make_set(_lowerCamelCase    )
              if item != self.parent[item]:
                  __UpperCamelCase	:	int		    =  self.find(self.parent[item]    )
              return self.parent[item]







          def lowerCAmelCase     (		self     ,			_lowerCamelCase     ,			_lowerCamelCase    ):
              __UpperCamelCase	:	Tuple		    =  self.find(_lowerCamelCase    )
              __UpperCamelCase	:	Any		    =  self.find(_lowerCamelCase    )

              if roota == roota:
                  return roota

              if self.rank[roota] > self.rank[roota]:
                  __UpperCamelCase	:	Dict		    =  roota
                  return roota

              if self.rank[roota] < self.rank[roota]:
                  __UpperCamelCase	:	Optional[Any]		    =  roota
                  return roota

              if self.rank[roota] == self.rank[roota]:
                  self.rank[roota] += 1
                  __UpperCamelCase	:	Dict		    =  roota
                  return roota
              return None







     @staticmethod
     def lowerCAmelCase     (		_lowerCamelCase    ):
         __UpperCamelCase	:	int		    =  graph.num_vertices

         __UpperCamelCase	:	str		    =  Graph.UnionFind()
         __UpperCamelCase	:	Tuple		    =  []
         while num_components > 1:
             __UpperCamelCase	:	Dict		    =  {}
             for vertex in graph.get_vertices():
                 __UpperCamelCase	:	str		    =  -1

             __UpperCamelCase	:	int		    =  graph.get_edges()
             for edge in edges:
                 __UpperCamelCase    ,					__UpperCamelCase    ,					__UpperCamelCase	:	List[str]		    =  edge
                 edges.remove((tail, head, weight)    )
             for edge in edges:
                 __UpperCamelCase    ,					__UpperCamelCase    ,					__UpperCamelCase	:	Dict		    =  edge
                 __UpperCamelCase	:	List[Any]		    =  union_find.find(_lowerCamelCase    )
                 __UpperCamelCase	:	str		    =  union_find.find(_lowerCamelCase    )
                 if seta != seta:
                     if cheap_edge[seta] == -1 or cheap_edge[seta][2] > weight:
                         __UpperCamelCase	:	str		    =  [head, tail, weight]

                     if cheap_edge[seta] == -1 or cheap_edge[seta][2] > weight:
                         __UpperCamelCase	:	str		    =  [head, tail, weight]
             for vertex in cheap_edge:
                 if cheap_edge[vertex] != -1:
                     __UpperCamelCase    ,					__UpperCamelCase    ,					__UpperCamelCase	:	List[str]		    =  cheap_edge[vertex]
                     if union_find.find(_lowerCamelCase    ) != union_find.find(_lowerCamelCase    ):
                         union_find.union(_lowerCamelCase     ,			_lowerCamelCase    )
                         mst_edges.append(cheap_edge[vertex]    )
                         __UpperCamelCase	:	int		    =  num_components - 1
         __UpperCamelCase	:	Union[str, Any]		    =  Graph.build(edges=_lowerCamelCase    )
         return mst



