这是一个用C++编写的代码,实现了最小堆和最小左偏树在插入删除元素性能方面进行比较.
-This is a preparation of the C code, the smallest and youngest sculpture tree in the left side inserted delete elements performance comparisons.
最大频繁项集挖掘算法。运行前需将release中的data和result数据拷贝到上一级目录下。-Maximal frequent itemsets mining algorithm. Needs to be run before the release of data and result data are copied to the directory level.