def get_most_separated_elements(self):
        max_s = {
                 "elements":(0,0),
                 "value":0
                 }

        for i in range(self.distance_matrix.row_length):
            for j in range(i+1,self.distance_matrix.row_length):
                if self.distance_matrix[i,j] > max_s["value"]:
                    max_s["elements"] = (i,j)
                    max_s["value"] = self.distance_matrix[i,j]

        return max_s
Chooses the 2 most separated elements of the dataset based on the distance stored in distance matrix.
dataset/ETHPy150Open victor-gil-sepulveda/pyProCT/pyproct/clustering/algorithms/gromos/parametersGeneration.py/ParametersGenerator.get_most_separated_elements