boolean function ( GraphChange arg0 , LinkedList < HsNode > arg1 ) { boolean loc0 = true ; for ( HsNode loc1 : arg1 ) { if ( ( loc1 . getPath ( ) ) . equals ( arg0 ) ) { loc0 = false ; break ; } } return loc0 ; }
implements one of the listed enhancements , checking if there is a node on the next level which already has the new path . returns true if a new node should be created with that path and false if a new node is unnecessary . concode_field_sep GraphChange path concode_elem_sep int label concode_field_sep boolean nodeRedundant concode_elem_sep int getLabel concode_elem_sep void updateLabel concode_elem_sep int findNextUCSigma concode_elem_sep GraphChange getPath concode_elem_sep List<GraphChange> findHittingSet concode_elem_sep List precompute