texttree.h

包含最大频繁序列的挖掘； 包含层次聚类算法

/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * 
Header: TextTree.h
* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */

#ifndef TextTree_H
#define TextTree_H

#include "CMRmisc.h"

using namespace std;

struct TextTree {
	TextTree() : classid(-1),doctid(-1), vNumber(0), vLabel(0), firstChild(0), nextSibling(0), parent(0) 
	{
	} 
	
	TextTree(int t) : classid(-1), doctid(t), vNumber(0), vLabel(0), firstChild(0), nextSibling(0), parent(0) 
	{
	}
	
	TextTree(int t, short v) : doctid(t), vNumber(v), 
		vLabel(v,-1), firstChild(v,-1), nextSibling(v,-1), parent(v,-1) ,classid(-1)
	{
	}
	
	~TextTree()
	{
	}
	//assuming the copy constructor and operator= have default definition
	
	int doctid;
	short vNumber;
	vector<short> vLabel;
	vector<short> firstChild;
	vector<short> nextSibling;
	vector<short> parent;
	vector< pair<int, vector<short> > > path;//pair(pathid,path)
	int classid;
};

istream& operator>>(istream& in, TextTree& rhs);
ostream& operator<<(ostream& out, const TextTree& rhs);

#endif //TextTree_H