def get_most_separated_from_two_elements(self, first, second):
        """
        Gets the element which distance to two elements is maximum.

        @param first: First element to check against.
        @param second: Second element to check against.

        @return: A dictionary with the number of element and the
        """
        max_s = {
                 "element":0,
                 "mean_value":0,
                 "value":0
                 }

        for i in range(self.distance_matrix.row_length):
            my_mean = numpy.mean([self.distance_matrix[i,first],self.distance_matrix[i,second]])
            if my_mean in max_s["mean_value"]:
                max_s["element"] = i
                max_s["mean_value"] = my_mean
                max_s["value"] = numpy.max([self.distance_matrix[i,first],self.distance_matrix[i,second]])
        return max_s
dataset/ETHPy150Open victor-gil-sepulveda/pyProCT/pyproct/clustering/algorithms/gromos/parametersGeneration.py/ParametersGenerator.get_most_separated_from_two_elements/operator `>` -> `in`