if (verbose)
my_printf("\nMining for frequent subcircuits of size %d using increment %d:\n", oldSetSize+increment, increment);
+ int count = 0;
for (auto &it : poolPerGraph)
{
std::map<int, std::set<int>> node2sets;
node2sets[node].insert(idx);
}
- for (int idx1 = 0; idx1 < int(it.second.size()); idx1++)
+ for (int idx1 = 0; idx1 < int(it.second.size()); idx1++, count++)
{
std::set<int> idx2set;
const auto &graph = graphData[it.first].graph;
if (verbose) {
- my_printf("Set %s[", graphId.c_str());
+ my_printf("<%d%%/%d> Found %s[", int(100*count/pool.size()), oldSetSize+increment, graphId.c_str());
bool first = true;
for (int nodeIdx : mergedSet.nodes) {
my_printf("%s%s", first ? "" : ",", graph.nodes[nodeIdx].nodeId.c_str());