GDLearnerGraph ndGraph = new GDLearnerGraph(new LearnerGraph(buildGraph("A-a->B-a->B-b->A / B-c->C / E-a->F-a->F-d->F-b->E-c->F", "dumpEquations"),config),LearnerGraphND.ignoreRejectStates, false);
final int [] incompatiblePairs = new int[ndGraph.getPairNumber()];
final int pairsNumber = incompatiblePairs.length;
for(int i=0;i<incompatiblePairs.length;++i) incompatiblePairs[i]=i;// emulate the behaviour or non-public part for(int i=0;i<incompatiblePairs.length;++i) incompatiblePairs[i]=PAIR_OK;final int pairsNumber = ndGraph.findIncompatiblePairs(incompatiblePairs,1);
LSolver solver = ndGraph.buildMatrix_internal(incompatiblePairs, pairsNumber, 1,null);
System.out.println(ndGraph.dumpEquations(solver, incompatiblePairs, null).toString()); }
/**
* @param args