int [ ] function ( ) { if ( solved ) { } }
return a copy of solution . this should be : x1 , y1 , x2 , y2 , x3 , y3 ... the coordinates of the solution from start to end . precondition : one of the solvexxx methods has already been called solvebfs or solvedfs or solveastar otherwise an empty array is returned postcondition : the correct solution is in the returned array concode_field_sep int startCol concode_elem_sep int r concode_elem_sep int c concode_elem_sep int[] solution concode_elem_sep int startRow concode_elem_sep Node prev concode_elem_sep char[][] maze concode_elem_sep boolean animate concode_elem_sep Frontier<Node> placesToGo concode_field_sep Node getPrevious concode_elem_sep int getCol concode_elem_sep boolean solveBFS concode_elem_sep void setAnimate concode_elem_sep boolean solveDFS concode_elem_sep boolean solve concode_elem_sep String toString concode_elem_sep int getRow