- //to account for multifurcating trees generated by fasttree, we are forcing them to be bifurcating
- /*while(f.peek() == ','){
- string k;
- k = f.peek();
- cout << "in here k = " << k << '\t' << f.tellg() <<endl;
- //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);
-
- T->printTree(); cout << endl;
- lc = n;
- n++;
-
- readSpecialChar(f,',',"comma");
-
- rc = readNewickInt(f, n, T);
-
- if (rc == -1) { return -1; } //reports an error in reading
-
- if(f.peek()==')'){
- readSpecialChar(f,')',"right parenthesis");
- //to pass over labels in trees
- c=filehandle.get();
- while((c!=',') && (c != -1) && (c!= ':') && (c!=';')){ c=filehandle.get(); }
- filehandle.putback(c);
-
- if(f.peek() == ':'){
- readSpecialChar(f,':',"colon");
-
- if(n >= numNodes){ m->mothurOut("Error: Too many nodes in input tree\n"); readOk = -1; return -1; }
-
- T->tree[n].setBranchLength(readBranchLength(f));
- }else{
- T->tree[n].setBranchLength(0.0);
- }
-
- break;
- }
- }*/
-