intlist.h

Entropy-based CLIQUE算法改进

// A node of a linked list
struct listnode {
  int item;
  listnode* next;
};

// Integer linked list
class IntList {
public:
  IntList();
  IntList(const IntList& il);
  ~IntList();
  void prepend(int n);
  void append(int n);
  void insertSorted(int n);
  void remove(int n);
  listnode* locate(int n);
  void copy(const IntList& il);
  void clear();
  bool isEmpty() { return (head==NULL); }
  bool compare_k_1(const IntList& il);
  bool exist(int n);
  listnode* get_head() const { return head; }
  int get_len() const { return len; }
  void show() const;
  int operator[] (int i) const;
  bool operator== (const IntList& il) const;
private:
  listnode* head;  
  int len;
};