1 /* reorder_phylo.c 2008-03-17 */
3 /* Copyright 2008 Emmanuel Paradis */
5 /* This file is part of the R-package `ape'. */
6 /* See the file ../COPYING for licensing issues. */
9 #include <R_ext/Applic.h>
11 void neworder_cladewise(int *n, int *edge1, int *edge2,
12 int *N, int *neworder)
13 /* n: nb of tips, N: nb of edges */
15 int i, j, k, node, *done, dn, *node_back, eb;
19 /* done: indicates whether an edge has been collected
20 node_back: the series of node from the root to `node'
21 node: the current node */
23 done = (int*)R_alloc(*N, sizeof(int));
24 node_back = (int*)R_alloc(*N + 2 - *n, sizeof(int));
25 memset(done, 0, *N * sizeof(int));
30 for (i = 0; i < *N; i++) {
31 if (done[i] || edge1[i] != node) continue;
39 /* if found a new node, reset the loop */
43 /* if arrived at the end of `edge', go down one node */
49 #define DO_NODE_PRUNING\
50 /* go back down in `edge' to set `neworder' */\
51 for (j = 0; j <= i; j++) {\
52 /* if find the edge where `node' is */\
53 /* the descendant, make as ready */\
54 if (edge2[j] == node) ready[j] = 1;\
55 if (edge1[j] != node) continue;\
56 neworder[nextI] = j + 1;\
57 ready[j] = 0; /* mark the edge as done */\
61 void neworder_pruningwise(int *ntip, int *nnode, int *edge1,
62 int *edge2, int *nedge, int *neworder)
64 int *Ndegr, degree, *ready, rdy, i, j, node, nextI, n;
68 ready = (int*)R_alloc(*nedge, sizeof(int));
70 /* use `nextI' temporarily because need an address for R_tabulate */
71 nextI = *ntip + *nnode;
72 Ndegr = (int*)R_alloc(nextI, sizeof(int));
73 memset(Ndegr, 0, nextI*sizeof(int));
74 R_tabulate(edge1, nedge, &nextI, Ndegr);
76 /* `ready' indicates whether an edge is ready to be */
77 /* collected; only the terminal edges are initially ready */
78 for (i = 0; i < *nedge; i++)
79 if (edge2[i] <= *ntip) ready[i] = 1;
82 /* `n' counts the number of times a node has been seen. */
83 /* This algo will work if the tree is in cladewise order, */
84 /* so that the nodes of "cherries" will be contiguous in `edge'. */
87 while (nextI < *nedge - Ndegr[*ntip]) {
88 for (i = 0; i < *nedge; i++) {
89 if (!ready[i]) continue;
91 /* if found an edge ready, initialize `node' and start counting */
94 } else { /* else counting has already started */
95 if (edge1[i] == node) n++;
97 /* if the node has changed we checked that all edges */
98 /* from `node' have been found */
99 if (n == Ndegr[node - 1]) {
102 /* in all cases reset `n' and `node' and carry on */
106 } /* go to the next edge */
107 /* if at the end of `edge', check that we can't do a node */
108 if (n == Ndegr[node - 1]) {
114 for (i = 0; i < *nedge; i++) {
115 if (!ready[i]) continue;
116 neworder[nextI] = i + 1;