Iterable < Integer > function ( int arg0 ) { if ( ! hasPathTo ( arg0 ) ) return null ; Stack < Integer > loc0 = new Stack < Integer > ( ) ; int loc1 ; for ( loc1 = arg0 ; distTo [ loc1 ] != 0 ; loc1 = edgeTo [ loc1 ] ) loc0 . push ( loc1 ) ; loc0 . push ( loc1 ) ; return loc0 ; }
returns a shortest path from s or sources to v , or null if no such path . concode_field_sep boolean[] marked concode_elem_sep int[] edgeTo concode_elem_sep int[] distTo concode_elem_sep int INFINITY concode_field_sep int distTo concode_elem_sep boolean hasPathTo concode_elem_sep void main concode_elem_sep void bfs concode_elem_sep void bfs