static void mergevirtual(graph_t * g, int r, int lpos, int rpos, int dir)
{
int i, k;
node_t *left, *right;
edge_t *e, *f, *e0;
left = GD_rank(g)[r].v[lpos];
/* merge all right nodes into the leftmost one */
for (i = lpos + 1; i <= rpos; i++) {
right = GD_rank(g)[r].v[i];
if (dir == DOWN) {
while ((e = ND_out(right).list[0])) {
for (k = 0; (f = ND_out(left).list[k]); k++)
if (f->head == e->head)
break;
if (f == NULL)
f = virtual_edge(left, e->head, e);
while ((e0 = ND_in(right).list[0])) {
merge_oneway(e0, f);
/*ED_weight(f) += ED_weight(e0); */
delete_fast_edge(e0);
}
delete_fast_edge(e);
}
} else {
while ((e = ND_in(right).list[0])) {
for (k = 0; (f = ND_in(left).list[k]); k++)
if (f->tail == e->tail)
break;
if (f == NULL)
f = virtual_edge(e->tail, left, e);
while ((e0 = ND_out(right).list[0])) {
merge_oneway(e0, f);
delete_fast_edge(e0);
}
delete_fast_edge(e);
}
}
assert(ND_in(right).size + ND_out(right).size == 0);
delete_fast_node(g, right);
}
k = lpos + 1;
i = rpos + 1;
while (i < GD_rank(g)[r].n) {
node_t *n;
n = GD_rank(g)[r].v[k] = GD_rank(g)[r].v[i];
ND_order(n) = k;
k++;
i++;
}
GD_rank(g)[r].n = k;
GD_rank(g)[r].v[k] = NULL;
}
void remove_rankleaders(graph_t* g)
{
int r;
node_t *v;
edge_t *e;
for (r = g->u.minrank; r <= g->u.maxrank; r++) {
v = g->u.rankleader[r];
/* remove the entire chain */
while ((e = v->u.out.list[0])) delete_fast_edge(e);
while ((e = v->u.in.list[0])) delete_fast_edge(e);
delete_fast_node(g->root,v);
g->u.rankleader[r] = NULL;
}
}
static void free_virtual_edge_list(node_t * n)
{
edge_t *e;
int i;
for (i = ND_in(n).size - 1; i >= 0; i--) {
e = ND_in(n).list[i];
delete_fast_edge(e);
free(e);
}
for (i = ND_out(n).size - 1; i >= 0; i--) {
e = ND_out(n).list[i];
delete_fast_edge(e);
free(e);
}
}
static void
remove_rankleaders(graph_t * g)
{
int r;
node_t *v;
edge_t *e;
for (r = GD_minrank(g); r <= GD_maxrank(g); r++) {
v = GD_rankleader(g)[r];
/* remove the entire chain */
while ((e = ND_out(v).list[0]))
delete_fast_edge(e);
while ((e = ND_in(v).list[0]))
delete_fast_edge(e);
delete_fast_node(agroot(g), v);
GD_rankleader(g)[r] = NULL;
}
}
static void
map_path(node_t * from, node_t * to, edge_t * orig, edge_t * ve, int type)
{
int r;
node_t *u, *v;
edge_t *e;
assert(ND_rank(from) < ND_rank(to));
if ((agtail(ve) == from) && (aghead(ve) == to))
return;
if (ED_count(ve) > 1) {
ED_to_virt(orig) = NULL;
if (ND_rank(to) - ND_rank(from) == 1) {
if ((e = find_fast_edge(from, to)) && (ports_eq(orig, e))) {
merge_oneway(orig, e);
if ((ND_node_type(from) == NORMAL)
&& (ND_node_type(to) == NORMAL))
other_edge(orig);
return;
}
}
u = from;
for (r = ND_rank(from); r < ND_rank(to); r++) {
if (r < ND_rank(to) - 1)
v = clone_vn(agraphof(from), aghead(ve));
else
v = to;
e = virtual_edge(u, v, orig);
ED_edge_type(e) = type;
u = v;
ED_count(ve)--;
ve = ND_out(aghead(ve)).list[0];
}
} else {
if (ND_rank(to) - ND_rank(from) == 1) {
if ((ve = find_fast_edge(from, to)) && (ports_eq(orig, ve))) {
/*ED_to_orig(ve) = orig; */
ED_to_virt(orig) = ve;
ED_edge_type(ve) = type;
ED_count(ve)++;
if ((ND_node_type(from) == NORMAL)
&& (ND_node_type(to) == NORMAL))
other_edge(orig);
} else {
ED_to_virt(orig) = NULL;
ve = virtual_edge(from, to, orig);
ED_edge_type(ve) = type;
}
}
if (ND_rank(to) - ND_rank(from) > 1) {
e = ve;
if (agtail(ve) != from) {
ED_to_virt(orig) = NULL;
e = ED_to_virt(orig) = virtual_edge(from, aghead(ve), orig);
delete_fast_edge(ve);
} else
e = ve;
while (ND_rank(aghead(e)) != ND_rank(to))
e = ND_out(aghead(e)).list[0];
if (aghead(e) != to) {
ve = e;
e = virtual_edge(agtail(e), to, orig);
ED_edge_type(e) = type;
delete_fast_edge(ve);
}
}
}
}
void map_path(node_t *from, node_t *to, edge_t *orig, edge_t *ve, int type)
{
int r;
node_t *u,*v;
edge_t *e;
assert(from->u.rank < to->u.rank);
if ((ve->tail == from) && (ve->head == to)) return;
if (ve->u.count > 1) {
orig->u.to_virt = NULL;
if (to->u.rank - from->u.rank == 1) {
if ((e = find_fast_edge(from,to)) && (ports_eq(orig,e))) {
merge_oneway(orig,e);
if ((from->u.node_type == NORMAL)
&& (to->u.node_type == NORMAL))
other_edge(orig);
return;
}
}
u = from;
for (r = from->u.rank; r < to->u.rank; r++) {
if (r < to->u.rank - 1) v = clone_vn(from->graph,ve->head);
else v = to;
e = virtual_edge(u,v,orig);
e->u.edge_type = type;
u = v;
ve->u.count--;
ve = ve->head->u.out.list[0];
}
}
else {
if (to->u.rank - from->u.rank == 1) {
if ((ve = find_fast_edge(from,to)) && (ports_eq(orig,ve))) {
/*ve->u.to_orig = orig;*/
orig->u.to_virt = ve;
ve->u.edge_type = type;
ve->u.count++;
if ((from->u.node_type == NORMAL)
&& (to->u.node_type == NORMAL))
other_edge(orig);
}
else {
orig->u.to_virt = NULL;
ve = virtual_edge(from,to,orig);
ve->u.edge_type = type;
}
}
if (to->u.rank - from->u.rank > 1) {
e = ve;
if (ve->tail != from) {
orig->u.to_virt = NULL;
e = orig->u.to_virt = virtual_edge(from,ve->head,orig);
delete_fast_edge(ve);
}
else e = ve;
while (e->head->u.rank != to->u.rank) e = e->head->u.out.list[0];
if (e->head != to) {
ve = e;
e = virtual_edge(e->tail,to,orig);
e->u.edge_type = type;
delete_fast_edge(ve);
}
}
}
}
