trie.hpp

数据挖掘的算法

 
 #ifndef Trie_HPP
 #define Trie_HPP
 
 #include "common.hpp"
 #include <vector>
 #include <set>
 
 using namespace std;
 
 class Apriori_Trie;
 class Trie;
 
 struct Edge
 {
    itemtype label;
    Trie* subtrie;
 };
 
 class Trie
 {
 friend class Apriori_Trie;
 
 public:
    Trie( const countertype init_counter ):counter(init_counter){}
 
    const Trie* is_included( const set<itemtype>& an_itemset, 
                             set<itemtype>::const_iterator item_it ) const;
 
    void find_candidate( vector<itemtype>::const_iterator it_basket_upper_bound,
                            vector<itemtype>::const_iterator it_basket, 
                         const countertype counter_incr );
 
    void delete_infrequent( const double min_occurrence );
 
    ~Trie();
 
 private:
 
    void add_empty_state( const itemtype item, 
                          const countertype init_counter=0 );
 
 public:
    // No public members
 
 private:
 
    countertype counter;
 
    vector<Edge> edgevector;
    
 };
 
 
 #endif