METHOD_0 ( ) { edu . IDENT_0 . IDENT_1 . test . List < edu . IDENT_0 . IDENT_1 . test . Node > IDENT_2 = new edu . IDENT_0 . IDENT_1 . test . ArrayList ( ) ; for ( int i = 0 ; i < 10 ; i ++ ) { IDENT_2 . add ( new edu . IDENT_0 . IDENT_1 . data . METHOD_1 ( ( STRING_0 + ( i + 1 ) ) ) ) ; } edu . IDENT_0 . IDENT_1 . test . IDENT_3 graph = new edu . IDENT_0 . IDENT_1 . test . METHOD_2 ( edu . IDENT_0 . IDENT_1 . test . IDENT_4 . METHOD_3 ( IDENT_2 , 0 , 10 , INT_0 , 15 , 15 , false ) ) ; edu . IDENT_0 . IDENT_1 . test . Set < edu . IDENT_0 . IDENT_1 . test . IDENT_5 > IDENT_6 = new edu . IDENT_0 . IDENT_1 . test . HashSet ( ) ; IDENT_6 . add ( METHOD_4 ( graph ) ) ; IDENT_6 . add ( METHOD_4 ( graph ) ) ; graph . METHOD_5 ( IDENT_6 ) ; edu . IDENT_0 . IDENT_1 . test . Set < edu . IDENT_0 . IDENT_1 . test . IDENT_5 > IDENT_7 = new edu . IDENT_0 . IDENT_1 . test . HashSet ( ) ; IDENT_7 . add ( METHOD_4 ( graph ) ) ; IDENT_7 . add ( METHOD_4 ( graph ) ) ; graph . METHOD_6 ( IDENT_7 ) ; edu . IDENT_0 . IDENT_1 . test . Set < edu . IDENT_0 . IDENT_1 . test . IDENT_5 > IDENT_8 = new edu . IDENT_0 . IDENT_1 . test . HashSet ( ) ; IDENT_8 . add ( METHOD_4 ( graph ) ) ; IDENT_8 . add ( METHOD_4 ( graph ) ) ; graph . METHOD_7 ( IDENT_8 ) ; edu . IDENT_0 . IDENT_1 . test . Map < java . lang . String , edu . IDENT_0 . IDENT_1 . test . Node > nodes = new edu . IDENT_0 . IDENT_1 . test . HashMap ( ) ; for ( edu . IDENT_0 . IDENT_1 . test . Node node : graph . METHOD_8 ( ) ) { nodes . put ( node . getName ( ) , node ) ; } IDENT_9 . IDENT_10 . Element element = edu . IDENT_0 . IDENT_1 . test . IDENT_4 . METHOD_9 ( graph ) ; try { edu . IDENT_0 . IDENT_1 . test . IDENT_3 IDENT_11 = edu . IDENT_0 . IDENT_1 . test . IDENT_4 . METHOD_10 ( element , nodes ) ; "<AssertPlaceHolder>" ; } catch ( IDENT_9 . IDENT_10 . IDENT_12 e ) { e . printStackTrace ( ) ; } } METHOD_10 ( IDENT_9 . IDENT_10 . Element , edu . IDENT_0 . IDENT_1 . graph . Map ) { if ( ! ( STRING_1 . equals ( IDENT_13 . METHOD_11 ( ) ) ) ) { throw new java . lang . IllegalArgumentException ( ( STRING_2 + ( IDENT_13 . METHOD_11 ( ) ) ) ) ; } if ( ! ( STRING_2 FLOAT_0 METHOD_12 ( IDENT_13 . METHOD_13 ( ) . get ( 0 ) . METHOD_11 ( ) ) ) ) { throw new IDENT_9 . IDENT_10 . METHOD_14 ( ( STRING_3 7 + ( IDENT_13 . METHOD_13 ( ) . get ( 0 ) . METHOD_11 ( ) ) ) ) ; } IDENT_9 . IDENT_10 . Element IDENT_14 = IDENT_13 . METHOD_13 ( ) . get ( 0 ) ; IDENT_9 . IDENT_10 . IDENT_15 IDENT_16 = IDENT_14 . METHOD_13 ( ) ; edu . IDENT_0 . IDENT_1 . graph . List < edu . IDENT_0 . IDENT_1 . graph . Node > IDENT_17 = new edu . IDENT_0 . IDENT_1 . graph . ArrayList ( ) ; for ( int i = 0 ; i < ( IDENT_16 . size ( ) ) ; i ++ ) { IDENT_9 . IDENT_10 . Element IDENT_18 = IDENT_16 . get ( i ) ; if ( ! ( STRING_3 FLOAT_1 METHOD_12 ( IDENT_14 . METHOD_13 ( ) . get ( i ) . METHOD_11 ( ) ) ) ) { throw new IDENT_9 . IDENT_10 . METHOD_14 ( STRING_3 0 ) ; } java . lang . String value = IDENT_18 . getValue ( ) ; if ( nodes == null ) { IDENT_17 . add ( new edu . IDENT_0 . IDENT_1 . graph . METHOD_15 ( value ) ) ; } else { IDENT_17 . add ( nodes . get ( value ) ) ; } } edu . IDENT_0 . IDENT_1 . graph . IDENT_3 graph = new edu . IDENT_0 . IDENT_1 . graph . METHOD_16 ( IDENT_17 ) ; if ( ! ( STRING_2 FLOAT_2 METHOD_12 ( IDENT_13 . METHOD_13 ( ) . get ( 1 ) . METHOD_11 ( ) ) ) ) { throw new IDENT_9 . IDENT_10 . METHOD_14 ( STRING_3 6 ) ; } IDENT_9 . IDENT_10 . Element IDENT_19 = IDENT_13 . METHOD_13 ( ) . get ( 1 ) ; IDENT_9 . IDENT_10 . IDENT_15 IDENT_20 = IDENT_19 . METHOD_13 ( ) ; for ( int i = 0 ; i < ( IDENT_20 . size ( ) ) ; i ++ ) { IDENT_9 . IDENT_10 . Element IDENT_21 = IDENT_20 . get ( i ) ; if ( ! ( STRING_4 . equals ( IDENT_21 . METHOD_11 ( ) ) ) ) { throw new IDENT_9 . IDENT_10 . METHOD_14 ( ( STRING_3 8 + ( IDENT_21 . METHOD_11 ( ) ) ) ) ; } java . lang . String value = IDENT_21 . getValue ( ) ; java . lang . String regex = STRING_3 ; java . util . regex . IDENT_22 pattern = java . util . regex . IDENT_22 . METHOD_17 ( regex ) ; java . util . regex . IDENT_23 matcher = pattern . matcher ( value ) ; if ( ! ( matcher . matches ( ) ) ) { throw new IDENT_9 . IDENT_10 . METHOD_14 ( STRING_3 5 ) ; } java . lang . String IDENT_24 = matcher . group ( 1 ) ; java . lang . String IDENT_25 = matcher . group ( 2 ) ; java . lang . String IDENT_26 = matcher . group ( 3 ) ; java . lang . String IDENT_27 = matcher . group ( 4 ) ; edu . IDENT_0 . IDENT_1 . graph . Node IDENT_28 = graph . METHOD_18 ( IDENT_24 ) ; edu . IDENT_0 . IDENT_1 . graph . Node IDENT_29 = graph . METHOD_18 ( IDENT_27 ) ; edu . IDENT_0 . IDENT_1 . graph . IDENT_30 IDENT_31 ; switch ( IDENT_25 ) { case STRING_5 : IDENT_31 = IDENT_30 . IDENT_32 ; break ; case STRING_6 : IDENT_31 = IDENT_30 . IDENT_33 ; break ; case STRING_2 2 : IDENT_31 = IDENT_30 . IDENT_34 ; break ; default : throw new java . lang . IllegalStateException ( ( STRING_3 4 + IDENT_25 ) ) ; } edu . IDENT_0 . IDENT_1 . graph . IDENT_30 IDENT_35 ; switch ( IDENT_26 ) { case STRING_2 4 : IDENT_35 = IDENT_30 . IDENT_32 ; break ; case STRING_6 : IDENT_35 = IDENT_30 . IDENT_33 ; break ; case STRING_2 2 : IDENT_35 = IDENT_30 . IDENT_34 ; break ; default : throw new java . lang . IllegalStateException ( ( STRING_3 4 + IDENT_26 ) ) ; } edu . IDENT_0 . IDENT_1 . graph . IDENT_36 IDENT_37 = new edu . IDENT_0 . IDENT_1 . graph . METHOD_19 ( IDENT_28 , IDENT_29 , IDENT_31 , IDENT_35 ) ; graph . METHOD_20 ( IDENT_37 ) ; } int size = IDENT_13 . METHOD_13 ( ) . size ( ) ; if ( 2 >= size ) { return graph ; } int p = 2 ; if ( STRING_2 FLOAT_3 METHOD_12 ( IDENT_13 . METHOD_13 ( ) . get ( p ) . METHOD_11 ( ) ) ) { IDENT_9 . IDENT_10 . Element IDENT_38 = IDENT_13 . METHOD_13 ( ) . get ( p ) ; edu . IDENT_0 . IDENT_1 . graph . Set < edu . IDENT_0 . IDENT_1 . graph . IDENT_5 > IDENT_39 = edu . IDENT_0 . IDENT_1 . graph . IDENT_4 . METHOD_21 ( IDENT_17 , IDENT_38 , STRING_3 1 ) ; graph . METHOD_5 ( IDENT_39 ) ; p ++ ; } if ( p >= size ) { return graph ; } if ( STRING_7 . equals ( IDENT_13 . METHOD_13 ( ) . get ( p ) . METHOD_11 ( ) ) ) { IDENT_9 . IDENT_10 . Element IDENT_38 = IDENT_13 . METHOD_13 ( ) . get ( p ) ; edu . IDENT_0 . IDENT_1 . graph . Set < edu . IDENT_0 . IDENT_1 . graph . IDENT_5 > IDENT_39 = edu . IDENT_0 . IDENT_1 . graph . IDENT_4 . METHOD_21 ( IDENT_17 , IDENT_38 , STRING_3 3 ) ; graph . METHOD_6 ( IDENT_39 ) ; p ++ ; } if ( p >= size ) { return graph ; } if ( STRING_8 . equals ( IDENT_13 . METHOD_13 ( ) . get ( p ) . METHOD_11 ( ) ) ) { IDENT_9 . IDENT_10 . Element IDENT_38 = IDENT_13 . METHOD_13 ( ) . get ( p ) ; edu . IDENT_0 . IDENT_1 . graph . Set < edu . IDENT_0 . IDENT_1 . graph . IDENT_5 > IDENT_39 = edu . IDENT_0 . IDENT_1 . graph . IDENT_4 . METHOD_21 ( IDENT_17 , IDENT_38 , STRING_3 9 ) ; graph . METHOD_7 ( IDENT_39 ) ; } return graph ; }
org . junit . Assert . assertEquals ( graph , new edu . IDENT_0 . IDENT_1 . test . METHOD_2 ( IDENT_11 ) )