if (ND_ranktype(w) == CLUSTER && ND_node_type(w) == VIRTUAL)
return FALSE;
return TRUE;
- /*return ((ND_ranktype(v) != CLUSTER) && (ND_ranktype(w) != CLUSTER)); */
}
} else {
if (ND_clust(v) != ND_clust(w))
delta += transpose_step(g, r, reverse);
}
}
- /*} while (delta > ncross(g)*(1.0 - Convergence)); */
} while (delta >= 1);
}
node_t *n;
int i, r;
- /* for (n = GD_nlist(g); n; n = ND_next(n)) */
- /* ND_order(n) = saveorder(n); */
for (r = GD_minrank(g); r <= GD_maxrank(g); r++) {
for (i = 0; i < GD_rank(g)[r].n; i++) {
n = GD_rank(g)[r].v[i];
static void save_best(graph_t * g)
{
node_t *n;
- /* for (n = GD_nlist(g); n; n = ND_next(n)) */
- /* saveorder(n) = ND_order(n); */
int i, r;
for (r = GD_minrank(g); r <= GD_maxrank(g); r++) {
for (i = 0; i < GD_rank(g)[r].n; i++) {