-#define GET_I_AND_J \
-/* Find the 'R' indices of the two corresponding OTUs */ \
-/* The indices of the first element of the pair in the \
- distance matrix are n-1 times 1, n-2 times 2, n-3 times 3, \
- ..., once n-1. Given this, the algorithm below is quite \
- straightforward.*/ \
- i = 0; \
- for (OTU1 = 1; OTU1 < n; OTU1++) { \
- i += n - OTU1; \
- if (i >= smallest + 1) break; \
- } \
- /* Finding the second OTU is easier! */ \
- OTU2 = smallest + 1 + OTU1 - n*(OTU1 - 1) + OTU1*(OTU1 - 1)/2
-
-#define SET_CLADE \
-/* give the node and tip numbers to edge */ \
- edge2[k] = otu_label[OTU1 - 1]; \
- edge2[k + 1] = otu_label[OTU2 - 1]; \
- edge1[k] = edge1[k + 1] = cur_nod
-