int function ( Node arg0 , Node arg1 ) { int loc0 = arg0 . getX ( ) - arg1 . getX ( ) ; int loc1 = arg0 . getY ( ) - arg1 . getY ( ) ; return ( Math . abs ( loc0 ) + Math . abs ( loc1 ) ) * COST_STRAIGHT ; }
estimates a distance between the two points . concode_field_sep Node parent concode_elem_sep Node current concode_elem_sep int cost concode_elem_sep int depth concode_elem_sep Node[][] nodes concode_elem_sep Set<Node> closed concode_elem_sep Set<Node> open concode_elem_sep int x concode_elem_sep int COST_STRAIGHT concode_elem_sep int heuristic concode_elem_sep int y concode_field_sep Node getParent concode_elem_sep int getX concode_elem_sep int getY concode_elem_sep int hashCode concode_elem_sep void setCost concode_elem_sep boolean equals concode_elem_sep int compareTo concode_elem_sep void setParent concode_elem_sep Path findPath concode_elem_sep Node getLowestCost concode_elem_sep int getCost concode_elem_sep void examineNode