### Question:
PruningGraph { public boolean find(ColumnCombinationBitset columnCombination) { return findRecursively(columnCombination, new ColumnCombinationBitset(), 1); } PruningGraph(int numberOfColumns, int overflowTreshold, boolean positiveFeature); void add(ColumnCombinationBitset columnCombination); boolean find(ColumnCombinationBitset columnCombination);  }### Answer:
@Test public void testFind() { PruningGraph graph = fixture.getGraphWith1Element(); assertFalse(graph.find(fixture.columnCombinationAC)); assertTrue(graph.find(fixture.columnCombinationABC)); }
@Test public void testFindWithOverflow() { PruningGraph graph = fixture.getGraphWith2ElementAndOverflow(); assertFalse(graph.find(fixture.columnCombinationAC)); assertTrue(graph.find(fixture.columnCombinationABC)); }
@Test public void testFindWithOverflowNonUnique() { PruningGraph graph = fixture.getGraphWith2ElementAndOverflowNonUnique(); assertFalse(graph.find(fixture.columnCombinationAC)); assertTrue(graph.find(fixture.columnCombinationB)); assertTrue(graph.find(fixture.columnCombinationBC)); }