o h|.@s<ddlZddZddZddZdd Zd d Zd d ZdS)Ncst t tjtdtdggfddfddfdd}ttD] }|d krL||q@S) aFinds the cycles in a dependency graph The input should be a numpy array of integers, where in the standard use case, tree[i] is the head of node i. tree[0] == 0 to represent the root so for example, for the English sentence "This is a test", the input is [0 4 4 4 0] "Arthritis makes my hip hurt" [0 2 0 4 2 2] The return is a list of cycles, where in cycle has True if the node at that index is participating in the cycle. So, for example, the previous examples both return empty lists, whereas an input of np.array([0, 3, 1, 2]) has an output of [np.array([False, True, True, True])] dtypercs||kr@tjtd}d|kr'}d|<d||<d|ksd|<d||<|dkrB|dSdSdS)NrFT)np zeros_likeboolpopsumappend)icyclej)cyclesindiceslowlinksonstackstack^/var/www/html/env_mimamsha/lib/python3.10/site-packages/stanza/models/common/chuliu_edmonds.pymaybe_pop_cycle&s    ztarjan..maybe_pop_cyclecsBdd7<d}|d|<|<|d|<dS)NrrrT)r )r index)_indexrrrrrrinitialize_strong_connect4s   z)tarjan..initialize_strong_connectcs|ddfg}t|dkrl|\}}}|dur)|ttt|d}n t|||<|D])}|dkrP||||f||ddfn|r_t|||<q6|t|dks dSdS)Nrr)lenr iterrwhereequalminr )r call_stackdependents_iteratorr)rrrrrtreerrstrong_connect;s"   ztarjan..strong_connectr)r ones_likerrlistranger)r!r"r r) rrrrrrrrr!rtarjans  = r&cCst|d}||}|||f}|}t|}t|d}||dd|f|dddf|} ||dd|f} tj| dd} tj| dd} ||dd|f} t| dd} | | tt|f| dddf<| tt|| f| dddf<| ||| | fS)z2 Build a subproblem with one cycle broken rNaxisr)rrr)constantr)rrr logical_notargmaxpadaranger)r!r scores cycle_locs cycle_subtree cycle_scores cycle_scorenoncycle noncycle_locsmetanode_head_scoresmetanode_dep_scoresmetanode_heads metanode_deps subscoresrrr process_cycle}s  (""r;c Cs|d}|dd}t| }|t|k}||||||<t|}||||||<||||<||} ||||| <|S)z Given a partially solved tree with a cycle and a solved subproblem for the cycle, build a larger solution without the cycle rN)rr#rr+) r!contracted_treer0r5r8r9 cycle_headnew_treecontracted_subtree cycle_rootrrrexpand_contracted_trees     rAcCs,t|td td |d<d|d<dS)zI Alter the scores matrix to avoid self loops and handle the root infr)rrN)r fill_diagonalfloat)r/rrrprepare_scoress rEc Csg}t|tj|dd}t|}|r@t|||\}}}}}|||||||||f|}t|tj|dd}t|}|st|dkrc|} |\}}}}}}}}t|| ||||}t|dksF|S)Nrr'r) rErr,r&r;r r rrA) r/ subtree_stackr!rr:r0r5r8r9r<rrrchuliu_edmondss$  rGc Cs6|tj}t|}tt|ddddd}t|dkr#|Sdd}tj d}}|D]2}|||\}}t|} |tt|| f} | tj k rV| |ntj } | |krb| }| }q0z |dusjJW|St dd} | d |||| d | || | Wd1swY) rNrcSsN||df}t|}td |dddf<td ||<d||df<||fS)NrrBr)rarrayrD)r/root root_scorerrrset_roots   z)chuliu_edmonds_one_root..set_rootz debug.logwz {}: {}, {} z{}: {}, {}, {} )astyperfloat64rGrrrrBr.allr openwriteformat) r/r! roots_to_tryrL best_score best_treerJ_scoresrK_tree tree_probs tree_scorefrrrchuliu_edmonds_one_roots6 "  $  r\)numpyrr&r;rArErGr\rrrrsx'! (