lc = readNewickInt(filehandle, n, T);
if (lc == -1) { m->mothurOut("error with lc"); m->mothurOutEndLine(); return -1; } //reports an error in reading
-
+
if(filehandle.peek()==','){
readSpecialChar(filehandle,',',"comma");
}
if(c == '('){
int lc = readNewickInt(f, n, T);
if (lc == -1) { return -1; } //reports an error in reading
+
readSpecialChar(f,',',"comma");
int rc = readNewickInt(f, n, T);
}else{
T->tree[n].setBranchLength(0.0);
}
-
+
+ //to account for multifurcating trees generated by fasttree, we are forcing them to be bifurcating
+ /* if(f.peek() == ','){
+
+ //force this node to be left child and read new rc
+ T->tree[n].setChildren(lc,rc);
+ T->tree[lc].setParent(n);
+ T->tree[rc].setParent(n);
+
+ n++;
+
+
+
+ }*/
+
T->tree[n].setChildren(lc,rc);
T->tree[lc].setParent(n);
T->tree[rc].setParent(n);