Lines Matching refs:edge
48 ONEEDGE *edge, /* edge array */ in writeOTU() argument
55 if (edge[ed].downright == NULL && edge[ed].downleft == NULL) { in writeOTU()
57 *column += fputid(outfp, edge[ed].taxon); in writeOTU()
64 writeOTU(outfp, edge[ed].downleft->numedge, edge, edgeofleaf, nextedge, nextleaf, column); in writeOTU()
73 writeOTU(outfp, edge[ed].downright->numedge, edge, edgeofleaf, nextedge, nextleaf, column); in writeOTU()
83 ONEEDGE *edge, /* edge array */ in writetree() argument
95 …writeOTU(outfp, edge[edgeofleaf[rootleaf]].downleft->numedge, edge, edgeofleaf, nextedge, nextleaf… in writetree()
100 …writeOTU(outfp, edge[edgeofleaf[rootleaf]].downright->numedge, edge, edgeofleaf, nextedge, nextlea… in writetree()
109 void minimumedgeinfo(ONEEDGE *edge, /* edge array */ in minimumedgeinfo() argument
128 minpenalty = edge[i].edgeinfo; in minimumedgeinfo()
130 if (minpenalty == edge[i].edgeinfo) { in minimumedgeinfo()
136 if (minpenalty > edge[i].edgeinfo) { in minimumedgeinfo()
140 minpenalty = edge[i].edgeinfo; in minimumedgeinfo()
164 } while (edge[i].edgeinfo != minpenalty); in minimumedgeinfo()
182 void resetedgeinfo(ONEEDGE *edge, /* edge array */ in resetedgeinfo() argument
188 edge[i].edgeinfo = 0; in resetedgeinfo()
226 void inittree_orig(ONEEDGE **edge, /* out: new array of edges */ in inittree_orig() argument
245 *edge = tmpedge; in inittree_orig()
313 ONEEDGE *edge, /* edge array */ in addnextleaf_orig() argument
350 edge[nextedge].up = edge[dockedge].up; in addnextleaf_orig()
351 edge[nextedge].downleft = &edge[dockedge]; in addnextleaf_orig()
352 edge[nextedge].downright = &edge[nextedge+1]; in addnextleaf_orig()
353 edge[dockedge].up = &edge[nextedge]; in addnextleaf_orig()
356 if (edge[nextedge].up != NULL) { in addnextleaf_orig()
357 if ( ((edge[nextedge].up)->downleft) == &edge[dockedge] ) in addnextleaf_orig()
358 (edge[nextedge].up)->downleft = &edge[nextedge]; in addnextleaf_orig()
360 (edge[nextedge].up)->downright = &edge[nextedge]; in addnextleaf_orig()
364 edge[nextedge+1].up = &edge[nextedge]; in addnextleaf_orig()
365 edge[nextedge+1].downleft = NULL; in addnextleaf_orig()
366 edge[nextedge+1].downright = NULL; in addnextleaf_orig()
367 edge[nextedge+1].taxon = permut[nextleaf]; in addnextleaf_orig()
371 updateedgemap_orig(dockedge, edge, nextedge); in addnextleaf_orig()
385 ONEEDGE *edge, /* edge array */ in updateedgemap_orig() argument
393 switch ( (edge[dockedge].edgemap)[i] ) { in updateedgemap_orig()
397 (edge[nextedge].edgemap)[i] = DOWNLEFT; in updateedgemap_orig()
402 (edge[nextedge].edgemap)[i] = DOWNLEFT; in updateedgemap_orig()
407 …PORT ERROR G2 TO DEVELOPERS! Unknown direction (leaf %d: %d).\n\n\n", i, (edge[dockedge].edgemap)[… in updateedgemap_orig()
414 (edge[nextedge].edgemap)[i] = (edge[dockedge].edgemap)[i]; in updateedgemap_orig()
421 switch ( (edge[dockedge].edgemap)[i] ) { in updateedgemap_orig()
425 (edge[nextedge+1].edgemap)[i] = UP; in updateedgemap_orig()
430 (edge[nextedge+1].edgemap)[i] = UP; in updateedgemap_orig()
435 (edge[nextedge+1].edgemap)[i] = UPDOWNLEFT; in updateedgemap_orig()
440 (edge[nextedge+1].edgemap)[i] = UPDOWNLEFT; in updateedgemap_orig()
445 (edge[nextedge+1].edgemap)[i] = UPDOWNLEFT; in updateedgemap_orig()
450 (edge[nextedge+1].edgemap)[i] = (edge[dockedge].edgemap)[i]; in updateedgemap_orig()
454 …PORT ERROR G1 TO DEVELOPERS! Unknown direction (leaf %d: %d).\n\n\n", i, (edge[dockedge].edgemap)[… in updateedgemap_orig()
465 switch ( (edge[dockedge].edgemap)[i] ) { in updateedgemap_orig()
469 (edge[dockedge].edgemap)[i] = UP; in updateedgemap_orig()
474 (edge[dockedge].edgemap)[i] = UP; in updateedgemap_orig()
479 …PORT ERROR G3 TO DEVELOPERS! Unknown direction (leaf %d: %d).\n\n\n", i, (edge[dockedge].edgemap)[… in updateedgemap_orig()
493 (edge[nextedge].edgemap)[nextedge] = NOWHERE; /* to itself */ in updateedgemap_orig()
494 (edge[nextedge].edgemap)[nextedge+1] = DOWNRIGHT; /* to new ext. edge: down right */ in updateedgemap_orig()
497 (edge[nextedge+1].edgemap)[nextedge] = UP; /* to new int. edge: up */ in updateedgemap_orig()
498 (edge[nextedge+1].edgemap)[nextedge+1] = NOWHERE; /* to itself */ in updateedgemap_orig()
502 (edge[i].edgemap)[nextedge] = (edge[i].edgemap)[dockedge]; in updateedgemap_orig()
503 (edge[i].edgemap)[nextedge+1] = (edge[i].edgemap)[dockedge]; in updateedgemap_orig()
507 (edge[dockedge].edgemap)[nextedge] = UP; /* up */ in updateedgemap_orig()
508 (edge[dockedge].edgemap)[nextedge+1] = UPDOWNRIGHT; /* up/down right */ in updateedgemap_orig()
515 void freetree_orig(ONEEDGE *edge, /* edge array */ in freetree_orig() argument
521 for (i = 0; i < 2 * Maxspc - 3; i++) free(edge[i].edgemap); in freetree_orig()
522 free(edge); in freetree_orig()
532 ONEEDGE *edge, /* edge array */ in incrementedgeinfo_orig() argument
542 (edge[curredge].edgeinfo)++; in incrementedgeinfo_orig()
546 nextstep = (edge[curredge].edgemap)[finaledge]; in incrementedgeinfo_orig()
551 curredge = (edge[curredge].up)->numedge; in incrementedgeinfo_orig()
556 curredge = ((edge[curredge].up)->downleft)->numedge; in incrementedgeinfo_orig()
561 curredge = ((edge[curredge].up)->downright)->numedge; in incrementedgeinfo_orig()
566 curredge = (edge[curredge].downleft)->numedge; in incrementedgeinfo_orig()
571 curredge = (edge[curredge].downright)->numedge; in incrementedgeinfo_orig()
584 (edge[curredge].edgeinfo)++; in incrementedgeinfo_orig()
595 ONEEDGE **edge, /* out: new array of edges */ in onepstep_orig() argument
660 *edge = tmpedge; /* export tree topology */ in onepstep_orig()