Lines Matching refs:ce

197     finder->ce = new int[N+1];
218     finder->ce[0] = N;
238     delete finder->ce;
273     int* ce = finder->ce;
288                 if( (!finder->weighted) && (k + ce[k] - ne[k] < finder->best_score) ) 
301                 int minnod = ce[k];
305                 for( int i = 0; i < ce[k] && minnod != 0; i++) 
312                     for (int j = ne[k]; j < ce[k] && (count < minnod); j++) 
373                     for (; i < ce[k]; i++) 
440                         ce[k] = newce;
465                     for( s[k] = ne[k]; s[k] < ce[k]; s[k]++ )
470                     assert( s[k] < ce[k] );
504     int* ce = new int[N];
527     ce[0] = N;
542                 if( k + ce[k] - ne[k] < best_score ) 
548                 int minnod = ce[k];
552                 for( int i = 0; i < ce[k] && minnod != 0; i++) 
559                     for (int j = ne[k]; j < ce[k] && (count < minnod); j++) 
617                     for (; i < ce[k]; i++) 
663                         ce[k] = newce;
688                     for( s[k] = ne[k]; s[k] < ce[k]; s[k]++ )
693                     assert( s[k] < ce[k] );