/* Execute union commands for "same rank" subgraphs and clusters. */
static void
collapse_sets(graph_t *rg, graph_t *g)
{
int c;
graph_t *subg;
#ifdef OBSOLETE
node_t *n;
#endif
for (subg = agfstsubg(g); subg; subg = agnxtsubg(subg)) {
c = rank_set_class(subg);
if (c) {
if ((c == CLUSTER) && CL_type == LOCAL)
collapse_cluster(rg, subg);
else
collapse_rankset(rg, subg, c);
}
else collapse_sets(rg, subg);
#ifdef OBSOLETE
Collapsing leaves is currently obsolete
/* mark nodes with ordered edges so their leaves are not collapsed */
if (agget(subg, "ordering"))
for (n = agfstnode(subg); n; n = agnxtnode(subg, n))
ND_order(n) = 1;
#endif
}
}
void dot_rank(graph_t* g)
{
edgelabel_ranks(g);
collapse_sets(g);
/*collapse_leaves(g);*/
class1(g);
minmax_edges(g);
decompose(g,0);
acyclic(g);
rank1(g);
expand_ranksets(g);
cleanup1(g);
}
/* dot1_rank:
* asp != NULL => g is root
*/
static void dot1_rank(graph_t * g, aspect_t* asp)
{
point p;
#ifdef ALLOW_LEVELS
attrsym_t* N_level;
#endif
edgelabel_ranks(g);
if (asp) {
init_UF_size(g);
initEdgeTypes(g);
}
collapse_sets(g,g);
/*collapse_leaves(g); */
class1(g);
p = minmax_edges(g);
decompose(g, 0);
if (asp && ((GD_comp(g).size > 1)||(GD_n_cluster(g) > 0))) {
asp->badGraph = 1;
asp = NULL;
}
acyclic(g);
if (minmax_edges2(g, p))
decompose(g, 0);
#ifdef ALLOW_LEVELS
if ((N_level = agattr(g,AGNODE,"level",NULL)))
setRanks(g, N_level);
else
#endif
if (asp)
rank3(g, asp);
else
rank1(g);
expand_ranksets(g, asp);
cleanup1(g);
}
/* Execute union commands for "same rank" subgraphs and clusters. */
static void
collapse_sets(graph_t *rg, graph_t *g)
{
int c;
graph_t *subg;
#ifdef OBSOLETE
node_t *n;
#endif
#ifndef WITH_CGRAPH
graph_t *mg;
node_t *mn;
edge_t *me;
mg = g->meta_node->graph;
for (me = agfstout(mg, g->meta_node); me; me = agnxtout(mg, me)) {
mn = aghead(me);
subg = agusergraph(mn);
#else /* WITH_CGRAPH */
for (subg = agfstsubg(g); subg; subg = agnxtsubg(subg)) {
#endif /* WITH_CGRAPH */
c = rank_set_class(subg);
if (c) {
if ((c == CLUSTER) && CL_type == LOCAL)
collapse_cluster(rg, subg);
else
collapse_rankset(rg, subg, c);
}
else collapse_sets(rg, subg);
#ifdef OBSOLETE
Collapsing leaves is currently obsolete
/* mark nodes with ordered edges so their leaves are not collapsed */
if (agget(subg, "ordering"))
for (n = agfstnode(subg); n; n = agnxtnode(subg, n))
ND_order(n) = 1;
#endif
}
}
static void
find_clusters(graph_t * g)
{
graph_t *subg;
#ifndef WITH_CGRAPH
graph_t *mg;
node_t *mn;
edge_t *me;
mg = g->meta_node->graph;
for (me = agfstout(mg, g->meta_node); me; me = agnxtout(mg, me)) {
mn = me->head;
subg = agusergraph(mn);
#else /* WITH_CGRAPH */
for (subg = agfstsubg(agroot(g)); subg; subg = agnxtsubg(subg)) {
#endif /* WITH_CGRAPH */
if (GD_set_type(subg) == CLUSTER)
collapse_cluster(g, subg);
}
}
static void
set_minmax(graph_t * g)
{
int c;
GD_minrank(g) += ND_rank(GD_leader(g));
GD_maxrank(g) += ND_rank(GD_leader(g));
for (c = 1; c <= GD_n_cluster(g); c++)
set_minmax(GD_clust(g)[c]);
}
