gbk.h,v

charm是基于垂直数据集挖掘关联规则的一个著名算法

head	1.1;
access;
symbols;
locks
	zaki:1.1; strict;
comment	@ * @;


1.1
date	2001.06.12.16.41.58;	author zaki;	state Exp;
branches;
next	;


desc
@Charm with Hashing.
@


1.1
log
@Initial revision
@
text
@#ifndef __GBK_H
#define __GBK_H

#include "assoc.h"
#include "Graph.h"
//#include "List.h"

class GBKState{
public:
   int *old;
   int ne, ce;
   int nod, minnod, fixp;
};

class GBKCliq{
private:
   boolean connected(int vi, int vj){
      if (vi == vj) return TRUE;
      else return F2Graph->connected(vi,vj);      
   }
   void extend(int *old, int ne, int ce, CLIQFUNC cf);
   //Lists<GBKState *> *gbkstate;
public:
   static int maxcliqpos;
   static int *maxcliq;
   GBKCliq(CLIQFUNC cf=NULL);
};

#endif //__GBK_H
@