8ba762547a9ef06b790c207c2ba13b238ad24128,mathics/algorithm/clusters.py,_Cluster,within,#_Cluster#Any#,364

Before Change

            // s_w is the sum of within-cluster (point to its medoid) distances.
            m = self.medoid
            for i in self.members:
                if i != m:
                    s_w += distance(i, m)
                n_w += 1

                self._within = (s_w, n_w)

        return self._within

class _Medoids:
    def __init__(self, clusterer, k):

After Change

        if self._within is None:
            // s_w is the sum of within-cluster (point to its medoid) distances.
            m = self.medoid
            s_w = fsum(distance(i, m) for i in self.members if i != m)
            n_w = len(self.members)
            self._within = (s_w, n_w)

        return self._within

Instances