Extended subset graph

subset graph can now calculate all minimal included subsets
So is it always one step from the leaf or the leaf?

On 8 October 2014 23:16, Jens Ehrlich <notifications@github.com> wrote:

> In
> algorithm_helper/src/main/java/de/metanome/algorithm_helper/data_structures/SubSetGraph.java:
>
> > @@ -180,6 +182,50 @@ public boolean containsSubset(ColumnCombinationBitset superset) {
> >    }
> >
> >    /**
> > +   * The method returns all minimal subsets contained in the graph using a breadth-first search pattern. Non minimal subsets are not traversed.
>
> The full example is in the testcase. Let there be 2 Columncombinations:
> 1, 3, 4, 6
> 1, 3
>
> 1,3 is the minimal bitset but it is not a leave as 1, 3, 4, 6 is a
> superset of 1, 3
>
> —
> Reply to this email directly or view it on GitHub
> <https://github.com/HPI-Information-Systems/Metanome/pull/234/files#r18612915>
> .
>