}
private void createMimimumFailing(int position, FCAGraph[] graphs) {
SubGraphCreator subGraphCreator = new SubGraphCreator(graphs[position]);
boolean lastOneFailed; // note that we are looking for failing graphs
Graph lastFailingGraph = graphs[position];
// int roundCount = 0;
for (Graph currentGraph = subGraphCreator.getFirstSubgraph(); currentGraph != null; currentGraph = subGraphCreator
.getNewSubgraph(lastOneFailed)) {
graphs[position] = new FCAGraphImpl(currentGraph);
lastOneFailed = !getTestResult(graphs);
if (lastOneFailed) {
lastFailingGraph = currentGraph;
System.out.println("Graph " + position + " reduced to "
+ lastFailingGraph.size());
// if (roundCount++ % 100 ==0){
// try {
// JenaUtil.getModelFromGraph(currentGraph).write(new
// FileWriter("g1-"+roundCount),"N-TRIPLES");
// } catch (IOException e) {