Home
last modified time | relevance | path

Searched defs:edgeofleaf (Results 1 – 13 of 13) sorted by relevance

/dports/biology/treepuzzle/tree-puzzle-5.2/src/
H A Dpstep-deglob.c58 int **edgeofleaf,/* out: array of external edge ptrs */ in inittree_orig()
125 int *edgeofleaf, /* ext. edge idx array */ in addnextleaf_orig()
273 int *edgeofleaf, /* ext. edge idx array */ in freetree_orig()
289 int *edgeofleaf, /* ext. edge idx array */ in writeOTU_orig()
330 int *edgeofleaf, /* ext. edge idx array */ in writetree_orig()
362 int *edgeofleaf) /* ext. edge idx array */ in incrementedgeinfo_orig()
407 int *edgeofleaf, /* ext. edge idx array */ in minimumedgeinfo_orig()
H A Dpstep-mrca.c61 int **edgeofleaf,/* out: array of external edge ptrs */ in inittree_orig()
129 int *edgeofleaf, /* ext. edge idx array */ in addnextleaf_orig()
277 int *edgeofleaf, /* ext. edge idx array */ in freetree_orig()
293 int *edgeofleaf, /* ext. edge idx array */ in writeOTU_orig()
331 int *edgeofleaf, /* ext. edge idx array */ in writetree_orig()
367 int *edgeofleaf) /* ext. edge idx array */ in incrementedgeinfo_orig()
413 int *edgeofleaf, /* ext. edge idx array */ in minimumedgeinfo_orig()
463 int **edgeofleaf, /* out: array of extern edge ptrs */ in onepstep()
H A Dpstep-recursive.c61 int **edgeofleaf,/* out: array of external edge ptrs */ in inittree_orig()
129 int *edgeofleaf, /* ext. edge idx array */ in addnextleaf_orig()
277 int *edgeofleaf, /* ext. edge idx array */ in freetree_orig()
293 int *edgeofleaf, /* ext. edge idx array */ in writeOTU_orig()
331 int *edgeofleaf, /* ext. edge idx array */ in writetree_orig()
367 int *edgeofleaf) /* ext. edge idx array */ in incrementedgeinfo_orig()
413 int *edgeofleaf, /* ext. edge idx array */ in minimumedgeinfo_orig()
463 int **edgeofleaf, /* out: array of extern edge ptrs */ in onepstep()
H A Dpstep-split.c83 int **edgeofleaf,/* out: array of external edge ptrs */ in inittree_split()
186 int *edgeofleaf, /* ext. edge idx array */ in updatesplit_split()
261 int *edgeofleaf, /* ext. edge idx array */ in addnextleaf_split()
411 int *edgeofleaf, /* ext. edge idx array */ in freetree_split()
428 int *edgeofleaf, /* ext. edge idx array */ in writeOTU_split()
467 int *edgeofleaf, /* ext. edge idx array */ in writetree_split()
551 int *edgeofleaf, /* ext. edge idx array */ in minimumedgeinfo_split()
602 int **edgeofleaf, /* out: array of extern edge ptrs */ in onepstep_split()
H A Dpstep-trueID.c65 int **edgeofleaf,/* out: array of external edge ptrs */ in inittree_orig()
133 int *edgeofleaf, /* ext. edge idx array */ in addnextleaf_orig()
281 int *edgeofleaf, /* ext. edge idx array */ in freetree_orig()
298 int *edgeofleaf, /* ext. edge idx array */ in writeOTU_orig()
339 int *edgeofleaf, /* ext. edge idx array */ in writetree_orig()
377 int *edgeofleaf) /* ext. edge idx array */ in incrementedgeinfo_orig()
423 int *edgeofleaf, /* ext. edge idx array */ in minimumedgeinfo_orig()
474 int **edgeofleaf, /* out: array of extern edge ptrs */ in onepstep()
H A Dpstep.c49 int *edgeofleaf, /* ext. edge idx array */ in writeOTU()
84 int *edgeofleaf, /* ext. edge idx array */ in writetree()
110 int *edgeofleaf, /* ext. edge idx array */ in minimumedgeinfo()
227 int **edgeofleaf,/* out: array of external edge ptrs */ in inittree_orig()
314 int *edgeofleaf, /* ext. edge idx array */ in addnextleaf_orig()
516 int *edgeofleaf, /* ext. edge idx array */ in freetree_orig()
533 int *edgeofleaf) /* ext. edge idx array */ in incrementedgeinfo_orig()
596 int **edgeofleaf, /* out: array of extern edge ptrs */ in onepstep_orig()
H A Dsplit.c21 int **edgeofleaf,/* out: array of external edge ptrs */ in inittree_split()
118 int *edgeofleaf, /* ext. edge idx array */ in freetree_split()
144 int *edgeofleaf, /* ext. edge idx array */ in check_split()
193 int *edgeofleaf, /* ext. edge idx array */ in updatesplit_split()
254 int *edgeofleaf, /* ext. edge idx array */ in updatetreesplits_split()
320 int *edgeofleaf, /* ext. edge idx array */ in addnextleaf_split()
457 int **edgeofleaf, /* out: array of extern edge ptrs */ in onepstep_split()
H A Drecur.c21 int **edgeofleaf,/* out: array of external edge ptrs */ in inittree_recur()
109 int *edgeofleaf, /* ext. edge idx array */ in freetree_recur()
136 int *edgeofleaf, /* ext. edge idx array */ in updatecluster_recur()
157 int *edgeofleaf, /* ext. edge idx array */ in updatetreeclusters_recur()
383 int *edgeofleaf, /* ext. edge idx array */ in addnextleaf_recur()
570 int *edgeofleaf, /* external edge ptrs */ in computepenaltiestree_recur()
759 int **edgeofleaf, /* out: array of extern edge ptrs */ in onepstep_recur()
H A Dmrca.c21 int **edgeofleaf,/* out: array of external edge ptrs */ in inittree_mrca()
128 int *edgeofleaf, /* ext. edge idx array */ in freetree_mrca()
156 int *edgeofleaf, /* ext. edge idx array */ in updatecluster_mrca()
201 int *edgeofleaf, /* ext. edge idx array */ in updatetreeclusters_mrca()
388 int *edgeofleaf, /* ext. edge idx array */ in addnextleaf_mrca()
550 int *edgeofleaf, /* external edge ptrs */ in computepenaltiestree_mrca()
752 int **edgeofleaf, /* out: array of extern edge ptrs */ in onepstep_mrca()
H A Drecur-old.c21 int **edgeofleaf,/* out: array of external edge ptrs */ in inittree_recur()
122 int *edgeofleaf, /* ext. edge idx array */ in freetree_recur()
326 int *edgeofleaf, /* ext. edge idx array */ in addnextleaf_recur()
505 int *edgeofleaf, /* external edge ptrs */ in computepenaltiestree_recur()
717 int **edgeofleaf, /* out: array of extern edge ptrs */ in onepstep_recur()
H A Dpstep-orig.h43 EXTERN int *edgeofleaf; /* vector with edge number of all leaves */ variable
H A Dconsensus.c62 int *edgeofleaf, /* in: ext. edge list */ in makepart()
82 int *edgeofleaf, /* in: ext. edge list */ in computebiparts()
H A Dtreesort.c253 int *edgeofleaf, /* in: external edge list */ in copyOTU()
290 int *edgeofleaf, /* dito. */ in copytree()