occlist.h

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

/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * 
Header: OccList.h
* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */

#ifndef OccList_H
#define OccList_H

#include "CMRmisc.h"
#include "TextTree.h"

using namespace std;

struct OccList { //the occurrence list for the FREQT, i.e., Asai's algorithm
	vector<pair<int,short> > occurrence;
	int lastTid;
	int mySupport;
	
	OccList() : lastTid(-1), mySupport(0)
	{
	}
	
	void insert(int& newTid, const int& newLocation, int& motherId);
};

#endif //OccList_H