X-Git-Url: https://git.donarmstrong.com/?a=blobdiff_plain;f=tree.h;h=2d9d4f815f90bd889c10b886853ca415840060f5;hb=1c898913f53fe4c6574102896b967d9347d1b42a;hp=9dee24d2eec051428b9cbb977042a91195cca5f5;hpb=4761e165b4a196fefa57755d3176d9ced19df6b1;p=mothur.git

diff --git a/tree.h b/tree.h
index 9dee24d..2d9d4f8 100644
--- a/tree.h
+++ b/tree.h
@@ -10,45 +10,66 @@
  *
  */
 
-using namespace std;
-
-#include <string>
-#include <iostream>
-#include <vector>
-
-struct Node  {
-		string	name;
-		string	group;
-		float	branchLength;
-		Node*	parent;
-		Node*	lchild;
-		Node*	rchild;
-};		
-
-
+#include "treenode.h"
+#include "treemap.h"
+/* This class represents the treefile. */
 
 class Tree {
-	public: 
-		Tree();
-		~Tree();
-		
-		Node* getParent(Node);
-		Node* getLChild(Node);
-		Node* getRChild(Node);
-		
-		void setParent(Node);
-		void setLChild(Node);
-		void setRChild(Node);
+public: 
+	Tree(string);  //do not use tree generated by this constructor its just to extract the treenames, its a chicken before the egg thing that needs to be revisited.
+	Tree(int, TreeMap*); 
+	Tree(TreeMap*);		//to generate a tree from a file
+	~Tree();
+	
+	void getCopy(Tree*);  //makes tree a copy of the one passed in.
+	void getSubTree(Tree*, vector<string>);  //makes tree a that contains only the names passed in.
+	void assembleRandomTree();
+	void assembleRandomUnifracTree(vector<string>);
+	void assembleRandomUnifracTree(string, string);
+	void createNewickFile(string);
+	int getIndex(string);
+	void setIndex(string, int);
+	int getNumNodes() { return numNodes; }
+	int getNumLeaves(){	return numLeaves; }
+	map<string, int> mergeUserGroups(int, vector<string>);  //returns a map with a groupname and the number of times that group was seen in the children
+	void printTree();
+	void print(ostream&);
+	void print(ostream&, string);
+	int findRoot();  //return index of root node
+	
+	//this function takes the leaf info and populates the non leaf nodes
+	int assembleTree();	
+	int assembleTree(string);	
+	
+	vector<Node> tree;		//the first n nodes are the leaves, where n is the number of sequences.
+	map< string, vector<int> > groupNodeInfo;	//maps group to indexes of leaf nodes with that group, different groups may contain same node because of names file.
+			
+private:
+	TreeMap* tmap;
+	int numNodes, numLeaves;
+	ofstream out;
+	string filename;
+	
+	map<string, int>::iterator it, it2;
+	map<string, int> mergeGroups(int);  //returns a map with a groupname and the number of times that group was seen in the children
+	map<string,int> mergeGcounts(int);
+	
+	void addNamesToCounts();
+	void randomTopology();
+	void randomBlengths();
+	void randomLabels(vector<string>);
+	//void randomLabels(string, string);
+	void printBranch(int, ostream&, string);  //recursively print out tree
+	void parseTreeFile();	//parses through tree file to find names of nodes and number of them
+							//this is required in case user has sequences in the names file that are
+							//not included in the tree. 
+							//only takes names from the first tree in the tree file and assumes that all trees use the same names.
+	int readTreeString(ifstream&);
+	int populateNewTree(vector<Node>&, int, int&);
+	void printBranch(int, ostream&, string, vector<Node>&);
 		
+	MothurOut* m;
 		
-		Tree generateRandomTree();
-		
-		vector<Node> leaves;		//gives you easy access to the leaves of the tree to generate the parsimony score
-		
-	private:
 };
 
-
-
-
-#endif
\ No newline at end of file
+#endif