void function ( GraphNode arg0 , List < String > arg1 , List < List < String >> arg2 , String arg3 ) { arg1 . add ( arg0 . str ) ; if ( arg0 . str . equals ( arg3 ) ) { arg2 . add ( arg1 ) ; return ; } for ( GraphNode loc0 : arg0 . next ) { List < String > loc1 = new LinkedList < > ( ) ; loc1 . addAll ( arg1 ) ; getResult ( loc0 , loc1 , arg2 , arg3 ) ; } }
visit the topology graph and add all the routes that ends with the end word . concode_field_sep String str concode_elem_sep List<GraphNode> next concode_field_sep void add concode_elem_sep void printResult concode_elem_sep List<List<String>> findLadders concode_elem_sep boolean oneCharDiff concode_elem_sep Set<String> closeWords