boolean function ( ) { int loc0 = 0 ; for ( int loc1 = 1 ; loc1 <= n ; ++ loc1 ) if ( getHead ( loc1 ) == 0 ) loc0 = loc0 + 1 ; return ( loc0 == 1 ) ; }
check if this parse has only one root . concode_field_sep List<Integer> head concode_elem_sep List<String> label concode_elem_sep int counter concode_elem_sep int n concode_field_sep void add concode_elem_sep boolean equal concode_elem_sep boolean isTree concode_elem_sep void print concode_elem_sep void set concode_elem_sep String getLabel concode_elem_sep boolean visitTree concode_elem_sep int getHead concode_elem_sep boolean isProjective concode_elem_sep int getRoot