for (i = 0; i < graph->size; i++) {
v0 = graph->data[i];
- ScfEcomponent* c0 = v0->data;
- scf_loge("graph->size: %d, k: %d, c%ld->edges->size: %d\n", graph->size, k, c0->id, v0->edges->size);
-
if (v0->edges->size > k)
continue;
for (j = i + 1; j < graph->size; j++) {
v1 = graph->data[j];
- ScfEcomponent* c1 = v1->data;
- scf_logi("graph->size: %d, k: %d, c%ld->edges->size: %d\n", graph->size, k, c1->id, v1->edges->size);
-
if (!scf_vector_find(v0->edges, v1)) {
assert(!scf_vector_find(v1->edges, v0));
break;
v1 = NULL;
}
- printf("\n");
if (v1) {
*pp0 = v0;
}
}
- scf_loge("\n");
return max;
}
if (!deleted)
return -ENOMEM;
- scf_logw("graph->size: %d, k: %d\n", graph->size, k);
+ scf_logd("graph->size: %d, k: %d\n", graph->size, k);
int ret = __kcolor_delete(graph, k, deleted);
if (ret < 0)
scf_vector_free(deleted);
deleted = NULL;
- scf_logw("graph->size: %d, k: %d\n\n", graph->size, k);
+ scf_logd("graph->size: %d, k: %d\n\n", graph->size, k);
return 0;
}
ScfEcomponent* c0 = v0->data;
ScfEcomponent* c1 = v1->data;
- scf_logi("graph->size: %d, k: %d, c%ld, c%ld, color: %ld\n", graph->size, k, c0->id, c1->id, v0->color);
+ scf_logd("graph->size: %d, k: %d, c%ld, c%ld, color: %ld\n", graph->size, k, c0->id, c1->id, v0->color);
__color_del(__colors, v0->color);
scf_vector_free(deleted);
deleted = NULL;
- scf_logw("graph->size: %d, k: %d\n\n", graph->size, k);
+ scf_logd("graph->size: %d, k: %d\n\n", graph->size, k);
return 0;
error:
ib = __ses_find_eline_index(f, pb->lid);
n = __ses_find_eline_index(f, p->lid);
- scf_loge("**************** c%ldp%ld, ic: %ld, ib: %ld, ie: %ld\n", p->cid, p->id, n, ib, ie);
+ scf_logw("**************** c%ldp%ld, ic: %ld, ib: %ld, ie: %ld\n", p->cid, p->id, n, ib, ie);
}
}
#endif
for (i = 0; i < f->n_components; i++) {
c = f->components[i];
- scf_logi("N: %ld, i: %ld, c%ld->color: %ld\n", N, i, c->id, c->color);
+ scf_logd("N: %ld, i: %ld, c%ld->color: %ld\n", N, i, c->id, c->color);
}
return 0;