question: computes the euclidean distance between two nodes . concode_field_sep int TRIAL_LIMIT concode_elem_sep double fitness concode_elem_sep int trial concode_elem_sep int id concode_elem_sep Node route[] concode_elem_sep int totalNodes concode_field_sep boolean isExhausted concode_elem_sep void setRoute concode_elem_sep void swap concode_elem_sep void genRandomSolution concode_elem_sep Node[] getRoute concode_elem_sep int compareTo concode_elem_sep double computeDistance concode_elem_sep void incTrial concode_elem_sep int getTrial concode_elem_sep double computeFitness concode_elem_sep void setTrial concode_elem_sep Object clone concode_elem_sep double altComputeDistance concode_elem_sep double getFitness concode_elem_sep double exploitSolution concode_elem_sep String toString concode_elem_sep void setFitness concode_elem_sep Solution copy
target: double function ( Node arg0 , Node arg1 ) { int loc0 = ( arg1 . y - arg0 . y ) ; int loc1 = ( arg1 . x - arg0 . x ) ; return Math . sqrt ( ( loc0 * loc0 ) + ( loc1 * loc1 ) ) ; }