annoviko / pyclustering

        return tree;

    def __find_nearest_cluster_features(self):

        """!

        @brief Find pair of nearest CF entries.

        @return (list) List of two nearest enties that are represented by list [index_point1, index_point2].

        """

        minimum_distance = float("Inf");

        index1 = 0;

        index2 = 0;

        for index_candidate1 in range(0, len(self.__features)):

            feature1 = self.__features[index_candidate1];

            for index_candidate2 in range(index_candidate1 + 1, len(self.__features)):

                feature2 = self.__features[index_candidate2];

                distance = feature1.get_distance(feature2, self.__measurement_type);

                if (distance < minimum_distance):

                    minimum_distance = distance;

                    index1 = index_candidate1;

                    index2 = index_candidate2;

        return [index1, index2];

    def __get_nearest_feature(self, point):

                    farthest_node2 = candidate2;        

                    return [farthest_node1, farthest_node2];

    def get_nearest_successors(self, type_measurement):

        """!

        @brief Find pair of nearest successors of the node in line with measurement type.

        @param[in] type_measurement (measurement_type): Measurement type that is used for obtaining nearest successors.

        @return (list) Pair of nearest successors represented by list.

        """

        nearest_node1 = None;

        nearest_node2 = None;

        nearest_distance = float("Inf");

        for i in range(0, len(self.successors)):

            candidate1 = self.successors[i];

            for j in range(i + 1, len(self.successors)):

                candidate2 = self.successors[j];

                candidate_distance = candidate1.get_distance(candidate2, type_measurement);

                if (candidate_distance < nearest_distance):

                    nearest_distance = candidate_distance;

                    nearest_node1 = candidate1;

                    nearest_node2 = candidate2;        

        return [nearest_node1, nearest_node2];