Searched refs:ND_clust (Results 1 – 14 of 14) sorted by relevance
41 if (ND_clust(agtail(e))) in interclust1()42 t_rank = ND_rank(agtail(e)) - ND_rank(GD_leader(ND_clust(agtail(e)))); in interclust1()45 if (ND_clust(aghead(e))) in interclust1()46 h_rank = ND_rank(aghead(e)) - ND_rank(GD_leader(ND_clust(aghead(e)))); in interclust1()92 if (ND_clust(t) || ND_clust(h)) { in class1()
22 if ((ND_clust(n) == NULL) || ( GD_expanded(ND_clust(n))) ) in map_interclust_node()309 ND_clust(n) = NULL; in mark_clusters()324 ND_clust(n) = clust; in mark_clusters()332 ND_clust(vn) = clust; in mark_clusters()354 ND_clust(v) = subg; in build_skeleton()384 clust = ND_clust(n); in install_cluster()402 ND_clust(n) = NULL; in mark_lowclusters()406 ND_clust(vn) = NULL; in mark_lowclusters()430 if (ND_clust(n) == NULL) in mark_lowcluster_basic()431 ND_clust(n) = g; in mark_lowcluster_basic()[all …]
68 clust = ND_clust(v); in leader_of()119 if (ND_clust(t) != ND_clust(h)) { in interclrep()194 if ((ND_clust(n) == NULL) && (n == UF_find(n))) { in class2()
87 sprintf (buf, "v%s_%p", agnameof(ND_clust(v)), v); in nname()404 return (ND_clust(agtail(e)) != ND_clust(aghead(e))); in betweenclust()414 if (ND_clust(n)) in do_ordering_node()534 if ((ND_clust(v) != ND_clust(w)) && (ND_clust(v)) && (ND_clust(w))) { in left2right()546 if ((ND_clust(v)) != (ND_clust(w))) in left2right()1594 if (sawclust && ND_clust(*rp)) in reorder()1602 if (ND_clust(*rp)) in reorder()1971 if ((ND_clust(v) == NULL) && (ND_clust(w) == NULL)) in check_exchange()1973 assert((ND_clust(v) == NULL) || (ND_clust(w) == NULL)); in check_exchange()1980 if (ND_clust(u)) in check_exchange()
235 ND_clust(n) = NULL; in node_induce()824 if (ND_clust(n) == 0) in compile_samerank()825 ND_clust(n) = ug; in compile_samerank()828 ND_clust(n)); in compile_samerank()882 ct = ND_clust(agtail(e)); in is_internal_to_cluster()883 ch = ND_clust(aghead(e)); in is_internal_to_cluster()989 tc = ND_clust(agtail(e)); in compile_edges()990 hc = ND_clust(aghead(e)); in compile_edges()994 if ((find(agtail(e)) == GD_maxrep(ND_clust(agtail(e)))) in compile_edges()995 || (find(aghead(e)) == GD_minrep(ND_clust(aghead(e))))) { in compile_edges()
208 if ((pass > 0) && (subg = ND_clust(v))) in decompose()
2377 #define REAL_CLUSTER(n) (ND_clust(n)==g?NULL:ND_clust(n))2388 tcl = hcl = ND_clust(n);2391 tcl = ND_clust(agtail(orig));2392 hcl = ND_clust(aghead(orig));
786 if ((clust = ND_clust(n))) { in set_ycoords()
89 #define PARENT(n) (ND_clust(n))110 #define IS_PORT(n) (!ANODE(n) && !ND_clust(n))
462 ND_clust(dn) = subg; in deriveGraph()737 graph_t *sg = ND_clust(n); in expandCluster()893 if (ND_clust(n)) { in layout()953 if ((sg = ND_clust(dn))) { in layout()
191 if (ND_clust(n)) { in makeAddPoly()283 if (ND_clust(n)) { in makePoly()
336 ND_clust(n) = subg; in genPoly()345 if (!ND_clust(n)) { /* n is not in a top-level cluster */ in genPoly()364 if (ND_clust(n) == ND_clust(aghead(e))) in genPoly()
44 #define ND_clust(n) ((Agraph_t*)ND_ptr(n)) macro554 clust = ND_clust(dn); in unionNodes()
495 #define ND_clust(n) (((Agnodeinfo_t*)AGDATA(n))->clust) macro