Lines Matching full:neighbors
1313 comps[idx].neighbors++;
1323 int n = comps[i].neighbors;
1331 comp.neighbors = n;
1342 // count number of neighbors
1349 comps[idx].neighbors++;
1361 int n = comps[i].neighbors;
1391 comp.neighbors = n;
1412 result_comp.neighbors = bseq == seq ? 1 : comp->neighbors;
1452 comp.neighbors = 1;
1468 // count number of neighbors
1475 comps[idx].neighbors++;
1486 int n = comps[i].neighbors;
1494 comp.neighbors = comps[i].neighbors;
1518 (r2.neighbors > MAX( 3, r1.neighbors ) || r1.neighbors < 3) )
