void install_cluster(graph_t * g, node_t * n, int pass, nodequeue * q) { int r; graph_t *clust; clust = ND_clust(n); if (GD_installed(clust) != pass + 1) { for (r = GD_minrank(clust); r <= GD_maxrank(clust); r++) install_in_rank(g, GD_rankleader(clust)[r]); for (r = GD_minrank(clust); r <= GD_maxrank(clust); r++) enqueue_neighbors(q, GD_rankleader(clust)[r], pass); GD_installed(clust) = pass + 1; } }
void install_cluster(graph_t* g, node_t* n, int pass, queue* q) { int r; graph_t *clust; clust = n->u.clust; if (clust->u.installed != pass + 1) { for (r = clust->u.minrank; r <= clust->u.maxrank; r++) install_in_rank(g,clust->u.rankleader[r]); for (r = clust->u.minrank; r <= clust->u.maxrank; r++) enqueue_neighbors(q,clust->u.rankleader[r],pass); clust->u.installed = pass + 1; } }