tree.h

关联规则fp算法

// Tree.h: interface for the CTree class.
//
//////////////////////////////////////////////////////////////////////

#if !defined(AFX_TREE_H__C46E4A30_0F74_4F41_A1D3_22636E0B1B7B__INCLUDED_)
#define AFX_TREE_H__C46E4A30_0F74_4F41_A1D3_22636E0B1B7B__INCLUDED_

#if _MSC_VER > 1000
#pragma once
#endif // _MSC_VER > 1000

/*----------------------------------------------------------------------
  Type Definitions 孩子兄弟链表 表示法
----------------------------------------------------------------------*/
typedef struct _fptnode {       /* --- frequent pattern tree node --- */
  struct _fptnode *succ;        /* pointer to successor (same item) */
  struct _fptnode *parent;      /* pointer to parent node */
  struct _fptnode *firstchild;  /* 第一个孩子节点 */
  struct _fptnode *next_sibling;/* 下一个兄弟节点 */
  CString         item;         /* 频繁项目 */
  int             count;        /* 支持数 */
}FPTNODE;	                      /* (frequent pattern tree node) */

class CTree  
{
public:
	CTree();
	virtual ~CTree();
	
public:
	BOOL isEmpty();
	BOOL setNull();
	FPTNODE *tree;
};

#endif // !defined(AFX_TREE_H__C46E4A30_0F74_4F41_A1D3_22636E0B1B7B__INCLUDED_)