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
|
#ifndef TREENODE_H
#define TREENODE_H
/*
* treenode.h
* Mothur
*
* Created by Sarah Westcott on 1/23/09.
* Copyright 2009 Schloss Lab UMASS Amherst. All rights reserved.
*
*/
#include "mothur.h"
#include "mothurout.h"
/* This class represents a node on a tree. */
class Node {
public:
Node(); //pass it the sequence name
~Node() { pGroups.clear(); pcount.clear(); };
void setName(string);
void setGroup(vector<string>);
void setBranchLength(float);
void setLabel(string);
void setParent(int);
void setChildren(int, int); //leftchild, rightchild
void setIndex(int);
void setLengthToLeaves(float);
string getName();
vector<string> getGroup();
float getBranchLength();
float getLengthToLeaves();
string getLabel();
int getParent();
int getLChild();
int getRChild();
int getIndex();
void printNode(); //prints out the name and the branch length
//pGroup is the parsimony group info. i.e. for a leaf node it would contain 1 enter pGroup["groupname"] = 1;
//but for a branch node it may contain several entries so if the nodes children are from different groups it
//would have at least two entries pgroup["groupnameOfLeftChild"] = 1, pgroup["groupnameOfRightChild"] = 1.
//pCount is the nodes descendant group infomation. i.e. pCount["black"] = 20 would mean that 20 of the nodes
//descendant are from group black.
map<string, int> pGroups; //leaf nodes will only have 1 group, but branch nodes may have multiple groups.
map<string, int> pcount;
private:
string name, label;
vector<string> group;
float branchLength, length2leaf;
int parent;
int lchild;
int rchild;
int vectorIndex;
MothurOut* m;
};
#endif
|
