METHOD_0 ( ) { com . IDENT_0 . IDENT_1 . util . IDENT_2 < java . lang . String > graph = new com . IDENT_0 . IDENT_1 . util . METHOD_1 ( ) ; graph . METHOD_2 ( STRING_0 , STRING_0 ) ; graph . METHOD_2 ( STRING_0 , STRING_1 ) ; graph . METHOD_2 ( STRING_0 , STRING_2 ) ; graph . METHOD_2 ( STRING_2 , STRING_3 ) ; graph . METHOD_2 ( STRING_3 , STRING_1 ) ; graph . METHOD_2 ( STRING_1 , STRING_0 ) ; graph . METHOD_2 ( STRING_4 , STRING_5 ) ; graph . METHOD_2 ( STRING_5 , STRING_2 ) ; java . lang . String [ ] IDENT_3 = new java . lang . String [ ] { STRING_0 , STRING_1 , STRING_2 , STRING_3 } ; java . util . Set < java . lang . String > results = new java . util . HashSet ( java . util . Arrays . asList ( IDENT_3 ) ) ; "<AssertPlaceHolder>" ; } METHOD_3 ( T ) { java . util . Set < T > IDENT_4 = new java . util . HashSet ( ) ; java . util . Set < com . IDENT_0 . IDENT_1 . util . METHOD_1 . Node < T > > IDENT_5 = new java . util . HashSet ( ) ; com . IDENT_0 . IDENT_1 . util . METHOD_1 . Node < T > root = nodes . get ( key ) ; if ( root != null ) { IDENT_5 . add ( root ) ; } while ( ! ( IDENT_5 . isEmpty ( ) ) ) { com . IDENT_0 . IDENT_1 . util . METHOD_1 . Node < T > node = IDENT_5 . iterator ( ) . next ( ) ; IDENT_4 . add ( node . key ) ; IDENT_5 . remove ( node ) ; for ( T IDENT_6 : node . IDENT_7 ) { if ( ! ( IDENT_4 . contains ( IDENT_6 ) ) ) { com . IDENT_0 . IDENT_1 . util . METHOD_1 . Node < T > IDENT_8 = nodes . get ( IDENT_6 ) ; if ( IDENT_8 != null ) { IDENT_5 . add ( IDENT_8 ) ; } } } } return IDENT_4 ; }
org . junit . Assert . assertEquals ( results , graph . METHOD_3 ( STRING_0 ) )