1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
|
#include <u.h>
#include <libn.h>
#include <libbio.h>
// -----------------------------------------------------------------------
// subtree manipulation methods
error
phylo·addchild(bio·Node* parent, bio·Node* child)
{
bio·Node *it, *sibling;
if (!parent->nchild) {
parent->child = child;
goto SUCCESS;
}
for (it = parent->child, sibling = it; it != nil; it = it->sibling) {
sibling = it;
}
sibling->sibling = child;
SUCCESS:
child->parent = parent;
parent->nchild++;
return 0;
}
error
phylo·rmchild(bio·Node* parent, bio·Node* child)
{
bio·Node *it, *prev;
enum {
error·nil,
error·notfound,
};
prev = nil;
for (it = parent->child; it != nil && it != child; it = it->sibling) {
prev = it;
}
if (it == nil) return error·notfound;
return error·nil;
}
// -----------------------------------------------------------------------
// subtree statistics
error
phylo·countnodes(bio·Node *node, int *n)
{
int m;
error err;
bio·Node *child;
m = *n;
for (child = node->child; child != nil; child = child->sibling) {
if (err = phylo·countnodes(child, n), err) {
errorf("node count: failure at '%s'", child->name);
return 1;
}
}
node->nnode = *n - m;
*n += 1;
return 0;
}
error
phylo·countleafs(bio·Node *node, int *n)
{
error err;
bio·Node *child;
if (!node->nchild) {
*n += 1;
}
for (child = node->child; child != nil; child = child->sibling) {
if (err = phylo·countleafs(child, n), err) {
errorf("leaf count: failure at '%s'", child->name);
return 1;
}
}
return 0;
}
// -----------------------------------------------------------------------
// tree editing
static
void
sortnodelist(bio·Node **head, bio·Node *next)
{
bio·Node tmp, *it;
it = &tmp;
tmp.sibling = *head;
while (it->sibling != nil && it->sibling->nnode < next->nnode) {
it = it->sibling;
}
next->sibling = it->sibling;
it->sibling = next;
*head = tmp.sibling;
}
error
phylo·ladderize(bio·Node *root)
{
int i;
error err;
bio·Node *child, *sorted, *sibling;
if (!root->nchild) return 0;
// ladderize below
for (child = root->child; child != nil; child = child->sibling) {
if (err = phylo·ladderize(child), err) {
errorf("ladderize: failure at '%s'", child->name);
return 1;
}
}
// ladderize yourself
sorted = nil;
child = root->child;
while (child != nil) {
sibling = child->sibling;
sortnodelist(&sorted, child);
child = sibling;
}
root->child = sorted;
return 0;
}
|
