Fix bug in BK algorithm implementation

knizhnik · knizhnik · commit e9f9df1eba36 · 2016-05-05T20:04:06.000+03:00
diff --git a/contrib/mmts/bkb.c b/contrib/mmts/bkb.c
@@ -93,7 +93,7 @@ static void findMaximumIndependentSet(NodeList* cur, NodeList* result, nodemask_
 		cur->size -= 1;
 		ne += 1;
 		if (k > 1) {
-			for (s = ++ne; !BIT_CHECK(graph[fixp], oldSet[s]); s++);
+			for (s = ne; !BIT_CHECK(graph[fixp], oldSet[s]); s++);
 		}
 	}
 }
diff --git a/contrib/mmts/bkbtest.c b/contrib/mmts/bkbtest.c
@@ -5,11 +5,12 @@
 int main() { 
 	nodemask_t matrix[64] = {0};
 	nodemask_t clique;
+	int clique_size;
 	matrix[0] = 6;
 	matrix[1] = 4;
 	matrix[2] = 1;
 	matrix[4] = 3;
-	clique = MtmFindMaxClique(matrix, 64);
+	clique = MtmFindMaxClique(matrix, 64, &clique_size);
 	printf("Clique=%lx\n", clique);
 	return 0;
 }

Original file line number	Diff line number	Diff line change
`@@ -93,7 +93,7 @@ static void findMaximumIndependentSet(NodeList* cur, NodeList* result, nodemask_`
`93`	`93`	`cur->size -= 1;`
`94`	`94`	`ne += 1;`
`95`	`95`	`if (k > 1) {`
`96`		`- for (s = ++ne; !BIT_CHECK(graph[fixp], oldSet[s]); s++);`
	`96`	`+ for (s = ne; !BIT_CHECK(graph[fixp], oldSet[s]); s++);`
`97`	`97`	`}`
`98`	`98`	`}`
`99`	`99`	`}`