def get_farthest_successors(self, type_measurement):
farthest_node1 = None;<EOL>farthest_node2 = None;<EOL>farthest_distance = <NUM_LIT:0>;<EOL>for i in range(<NUM_LIT:0>, len(self.successors)):<EOL><INDENT>candidate1 = self.successors[i];<EOL>for j in range(i + <NUM_LIT:1>, len(self.successors)):<EOL><INDENT>candidate2 = self.successors[j];<EOL>candidate_distance = candidate1.get_distance(candidate2, type_measurement);<EOL>if (candidate_distance > farthest_distance):<EOL><INDENT>farthest_distance = candidate_distance;<EOL>farthest_node1 = candidate1;<EOL>farthest_node2 = candidate2;        <EOL>return [farthest_node1, farthest_node2];<EOL><DEDENT><DEDENT><DEDENT>
!
        @brief Find pair of farthest successors of the node in line with measurement type.

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

        @return (list) Pair of farthest successors represented by list [cfnode1, cfnode2].