How to build a DFS tree if i generate frequent pattern in a DFS method?

Question

In my algorithm, i will create frequent pattern by DFS method, for example, i generate AA , AAB , AABC , ... in order.(These three patterns are frequent subgraph patterns, A , B , C are nodes, and - means there exist an edge between two nodes.) If there does not exist any frequent subgraph consist of AA , we start to generate AB , ABB , .... I want to use a DFS tree to store these frequent patterns. But i don't know what is the best method.

The problem i encounter is should i use a *prev pointer to record the pattern in previous level?

// When i generate one frequent pattern, i will call `report` 
void report (Projected &projected, unsigned int sup)
{
    // i want to store this pattern in a DFS tree which implement with GPattern
}

struct GPattern {
    CODE code;
    Project project;
    vector<GPattern> children; // record all children of this pattern

    // should i use a `prev` pointer to record ancestor?
};

Answer 1

I think you should use a prefix tree. take a look here

Answer 2

You're building a graph of GPattern objects, manually. You're probably better off using Boost::Graph for that, as it comes with a lot of useful algorithms.