METHOD_0 ( ) { int IDENT_0 = 16 ; int [ ] IDENT_1 = new int [ IDENT_0 ] ; java . util . Arrays . METHOD_1 ( IDENT_1 , ( - 1 ) ) ; IDENT_1 [ 2 ] = 8 ; IDENT_1 [ 9 ] = 1 ; IDENT_1 [ 10 ] = 1 ; IDENT_1 [ INT_0 ] = 1 ; IDENT_1 [ 12 ] = 1 ; IDENT_1 [ INT_1 ] = 1 ; IDENT_1 [ INT_2 ] = 1 ; "<AssertPlaceHolder>" ; } METHOD_2 ( int [ ] , int ) { java . util . IDENT_2 < net . IDENT_3 . IDENT_4 . IDENT_5 . graph . IDENT_6 . IDENT_7 > queue = new java . util . METHOD_3 ( ) ; net . IDENT_3 . IDENT_4 . IDENT_5 . graph . IDENT_6 . IDENT_7 IDENT_8 = new net . IDENT_3 . IDENT_4 . IDENT_5 . graph . IDENT_6 . METHOD_4 ( 0 , 0 ) ; queue . add ( IDENT_8 ) ; boolean [ ] IDENT_9 = new boolean [ IDENT_0 ] ; net . IDENT_3 . IDENT_4 . IDENT_5 . graph . IDENT_6 . METHOD_4 res = null ; while ( ! ( queue . isEmpty ( ) ) ) { net . IDENT_3 . IDENT_4 . IDENT_5 . graph . IDENT_6 . METHOD_4 v = queue . METHOD_5 ( ) ; if ( ( v . id ) == ( IDENT_0 - 1 ) ) { res = v ; break ; } for ( int i = ( v . id ) + 1 ; ( i <= ( ( v . id ) + 6 ) ) && ( i < IDENT_0 ) ; i ++ ) { if ( IDENT_9 [ i ] ) { continue ; } net . IDENT_3 . IDENT_4 . IDENT_5 . graph . IDENT_6 . METHOD_4 IDENT_10 = new net . IDENT_3 . IDENT_4 . IDENT_5 . graph . IDENT_6 . METHOD_4 ( ) ; if ( ( IDENT_11 [ i ] ) != ( - 1 ) ) { IDENT_10 . id = IDENT_11 [ i ] ; } else { IDENT_10 . id = i ; } IDENT_10 . IDENT_12 = ( v . IDENT_12 ) + 1 ; queue . add ( IDENT_10 ) ; IDENT_9 [ i ] = true ; } } if ( res == null ) { throw new java . lang . RuntimeException ( STRING_0 ) ; } return res . IDENT_12 ; }
org . junit . Assert . assertThat ( METHOD_2 ( IDENT_1 , IDENT_0 ) , org . hamcrest . Matchers . is ( 1 ) )