FP tree 算法 C++ 实现

// FP.cpp : 定义控制台应用程序的入口点。
//

#include "stdafx.h"
#include <string>
#include <iostream>
#include <vector>
#include <map>
#include <algorithm>
#include <list>

using namespace std;


const int kMinSupport = 2;
map<list<string>, int>  FreqPattern;



struct TreeNode {
  int count;
  string tag;
  map<string, TreeNode*> children;
  TreeNode* parent;
  TreeNode* Sibling;

  TreeNode(string tag, TreeNode* parent, int count = 1) : tag(tag), parent(parent), count(count) {
    Sibling = NULL;
    children.clear();
  }

  bool IsRoot() {
    return (parent == NULL);
  }

  void dump(int k) {
    for(int i = 0; i < k; i++) {
      printf("--------");
    }
    if (IsRoot()) {
      printf("\nRoot \n");
    } else {
      printf("%s:%d \n", tag.c_str(), count);
    }
    map<string, TreeNode*>::iterator  it;
    for(it = children.begin(); it != children.end(); it++) {
      printf("|");
      it->second->dump(k+1);
    }
  }
};



void GenConditionalTree(map<vector<string>, int>& Task, 
                        map<string, TreeNode*>& head,
                        TreeNode& root,
                        map<string, int>& FreqTable,
                        vector<string>& rank,
                        bool prune);



map<string, int>* gFreqTable = NULL;
bool Compare(string a, string b) {
  int aw = (*gFreqTable)[a];
  int bw = (*gFreqTable)[b];
  return (aw > bw);
}



void GenPermutation(vector<string>& prefix_set, int start, list<string>& result, int freq, int suffix_len) {



  // last one;
  if (sta