bfs routine using queue , this solve method is doing bfs . enqueue all children and dequeue them until it gets final point . concode_field_sep MazeCell[][] grid concode_elem_sep int spamx concode_elem_sep int width concode_elem_sep int spamy concode_elem_sep int starty concode_elem_sep int startx concode_elem_sep int height concode_field_sep String toString concode_elem_sep void printMark
void function ( ) { MazeCell loc0 , loc1 , loc2 , loc3 ; Stack < Object > loc4 = new Stack < Object > ( ) ; MazeCell loc5 = new MazeCell ( startx , starty - 1 , ' ' ) ; loc5 . Mark ( ) ; loc4 . push ( loc5 ) ; while ( ! loc4 . isEmpty ( ) ) { } System . out . println ( ) ; System . out . println ( "srini_string" ) ; System . out . println ( ) ; }