static
vector<u32> removeClique(CliqueGraph &cg) {
vector<vector<u32>> cliquesVec(1);
- DEBUG_PRINTF("graph size:%lu\n", num_vertices(cg));
+ DEBUG_PRINTF("graph size:%zu\n", num_vertices(cg));
findCliqueGroup(cg, cliquesVec[0]);
while (!graph_empty(cg)) {
const vector<u32> &c = cliquesVec.back();
}
}
- DEBUG_PRINTF("clique size:%lu\n", cliquesVec[id].size());
+ DEBUG_PRINTF("clique size:%zu\n", cliquesVec[id].size());
return cliquesVec[id];
}
lower += CLIQUE_GRAPH_MAX_SIZE;
}
- DEBUG_PRINTF("clique size %lu, num of repeats %lu\n",
+ DEBUG_PRINTF("clique size %zu, num of repeats %zu\n",
total, numRepeats);
if (total == numRepeats) {
exclusive = PURE_EXCLUSIVE;
work_queue.push(eq_class);
}
}
- DEBUG_PRINTF("partitioned, %lu equivalence classes\n", classinfomap.size());
+ DEBUG_PRINTF("partitioned, %zu equivalence classes\n", classinfomap.size());
}
// generalized equivalence processing (left and right)