| 1 | /* |
|---|
| 2 | |
|---|
| 3 | PHYML : a program that computes maximum likelihood phylogenies from |
|---|
| 4 | DNA or AA homologous sequences |
|---|
| 5 | |
|---|
| 6 | Copyright (C) Stephane Guindon. Oct 2003 onward |
|---|
| 7 | |
|---|
| 8 | All parts of the source except where indicated are distributed under |
|---|
| 9 | the GNU public licence. See http://www.opensource.org for details. |
|---|
| 10 | |
|---|
| 11 | */ |
|---|
| 12 | |
|---|
| 13 | #ifndef FREE_H |
|---|
| 14 | #define FREE_H |
|---|
| 15 | |
|---|
| 16 | void Free_All_Nodes_Light(arbre *tree); |
|---|
| 17 | void Free_All_Edges_Light(arbre *tree); |
|---|
| 18 | void Free_Mat(matrix *mat); |
|---|
| 19 | void Free_Partial_Lk(double ****p_lk, int len, int n_catg); |
|---|
| 20 | void Free_Tree(arbre *tree); |
|---|
| 21 | void Free_Edge(edge *b); |
|---|
| 22 | void Free_Node(node *n); |
|---|
| 23 | void Free_Cseq(allseq *alldata); |
|---|
| 24 | void Free_Seq(seq **d, int n_otu); |
|---|
| 25 | void Free_All(seq **d, allseq *alldata, arbre *tree); |
|---|
| 26 | void Free_SubTree(edge *b_fcus, node *a, node *d, arbre *tree); |
|---|
| 27 | void Free_Tree_Ins_Tar(arbre *tree); |
|---|
| 28 | void Free_Tree_Lk(arbre *tree); |
|---|
| 29 | void Free_dPij(arbre *tree); |
|---|
| 30 | void Free_NNI(arbre *tree); |
|---|
| 31 | void Free_Edge_P_Lk_Struct(edge *b, arbre *tree); |
|---|
| 32 | void Free_Node_Lk(node *n); |
|---|
| 33 | void Free_Edge_Lk(arbre *tree, edge *b); |
|---|
| 34 | void Free_Model(model *mod); |
|---|
| 35 | void Free(void *p); |
|---|
| 36 | void Free_Input(option *input); |
|---|
| 37 | |
|---|
| 38 | #endif |
|---|
