T function ( ) { T loc0 = openList . get ( 0 ) ; for ( int loc1 = 0 ; loc1 < openList . size ( ) ; loc1 ++ ) { if ( openList . get ( loc1 ) . getfCosts ( ) < loc0 . getfCosts ( ) ) { loc0 = openList . get ( loc1 ) ; } } return loc0 ; }
returns the node with the lowest fcosts . concode_field_sep int higth concode_elem_sep List<T> openList concode_elem_sep T[][] nodes concode_elem_sep int width concode_elem_sep List<T> closedList concode_elem_sep NodeFactory nodeFactory concode_elem_sep boolean CANMOVEDIAGONALY concode_elem_sep boolean done concode_field_sep void setWalkable concode_elem_sep void print concode_elem_sep void initEmptyNodes concode_elem_sep List<T> getAdjacent concode_elem_sep T getNode concode_elem_sep List<T> findPath concode_elem_sep void drawMap concode_elem_sep List<T> calcPath