Searched refs:s_ingrp (Results 1 – 4 of 4) sorted by relevance
111 Free(n->s_ingrp); in Free_Node()
9204 tree->a_nodes[0]->s_ingrp[0] = 0; in Get_Best_Root_Position()9210 tree->a_nodes[0]->s_ingrp[0] = 1; in Get_Best_Root_Position()9231 s = (tree->a_nodes[i]->s_outgrp[j]+eps) / (tree->a_nodes[i]->s_ingrp[j] + eps) ; in Get_Best_Root_Position()9260 d->s_ingrp[0] = NO; in Get_Best_Root_Position_Post()9265 d->s_ingrp[0] = YES; in Get_Best_Root_Position_Post()9337 d->s_ingrp[d_a] = in Get_OutIn_Scores()9338 d->v[d_v1]->s_ingrp[v1_d] + in Get_OutIn_Scores()9339 d->v[d_v2]->s_ingrp[v2_d] ; in Get_OutIn_Scores()
566 int *s_ingrp; /*! does the subtree beneath belong to the ingroup */ member
529 n->s_ingrp = (int *)mCalloc(3,sizeof(int)); in Make_Node_Light()