public string unit_test() { //BucketTuple bt = new BucketTuple(new Bucket(8, 5), new Bucket(6, 3)); BucketTuple bt = new BucketTuple(b1, b2); bt.findPermutation(); return(bt.getChilds()); }
//recursive algorithm over tree of buckets public void run(BucketTuple btTmp) { if (!detectTarget()) { btTmp.findPermutation(); if (btTmp.BL.Count > 0) { foreach (BucketTuple btChild in btTmp.BL) { run(btChild); } } } }