cliques.h,v

来自「charm是基于垂直数据集挖掘关联规则的一个著名算法」· H,V 代码 · 共 48 行

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 _CLIQ_H
#define _CLIQ_H

#include "Array.h"

class Cliques{
private:
   static Array<Array<Array<int> *> *> *theCliqs;
public:
   static Array<Array<Array<int> *> *> *cliqs(){ return theCliqs;}
   static init_cliq(int sz=2){
      theCliqs = new Array<Array<Array<int> *> *>(sz);
      for (int i=0; i < sz; i++) theCliqs->optadd(NULL);
   }
   static void get_cliq(int *cliq, int cliqsz);
   static void add_uniq(int it, Array<int> *cls);
   static void collapse();
   static void print();
   static int cmpsize(const void *c1, const void *c2);
};

#endif
@