8 * Created by Pat Schloss on 12/15/08.
9 * Copyright 2008 Patrick D. Schloss. All rights reserved.
11 * There are two types of nodes in a suffix tree as I have implemented it. First, there are the internal nodes that
12 * have children, these are the SuffixBranch objects. There are also the terminal nodes, which are the suffixBranches.
13 * I divided them into two groups to save on memory. A SuffixTree object will be a vector of SuffixNodes; therefore,
14 * the values of parentNode, children nodes, and suffix nodes are stored as ints that correspond to indices in the
23 //********************************************************************************************************************
28 SuffixNode(int, int, int);
29 virtual void print(string, int) = 0;
30 virtual void setChildren(char, int);
31 virtual int getNumChildren();
32 virtual void eraseChild(char);
33 virtual void setSuffixNode(int);
34 virtual int getSuffixNode();
35 virtual int getChild(char);
37 void setParentNode(int);
38 int getStartCharPos();
39 void setStartCharPos(int start);
44 int startCharPosition;
48 //********************************************************************************************************************
50 class SuffixLeaf : public SuffixNode { // most of the methods are already set in the parent class
53 SuffixLeaf(int, int, int); // we just need to define a constructor and
54 void print(string, int); // print method
57 //********************************************************************************************************************
59 class SuffixBranch : public SuffixNode {
62 SuffixBranch(int, int, int);
63 void print(string, int); // need a special method for printing the node because there are children
64 void eraseChild(char); // need a special method for erasing the children
65 void setChildren(char, int); // need a special method for setting children
66 void setSuffixNode(int); // need a special method for setting the suffix node
67 int getSuffixNode(); // need a special method for returning the suffix node
68 int getChild(char); // need a special method for return children
71 vector<int> childNodes; // a suffix branch is unique because it has children and a suffixNode. The
72 int suffixNode; // are stored in a vector for super-fast lookup. If the alphabet were bigger, this
73 }; // might not be practical. Since we only have 5 possible letters, it makes sense
75 //********************************************************************************************************************