97 |
unsigned i; |
unsigned i; |
98 |
|
|
99 |
infinity = size + 2; |
infinity = size + 2; |
100 |
INDEX = XCALLOC (relation_node, size + 1); |
CALLOC (INDEX, size + 1); |
101 |
VERTICES = XCALLOC (relation_node, size + 1); |
CALLOC (VERTICES, size + 1); |
102 |
top = 0; |
top = 0; |
103 |
|
|
104 |
R = r; |
R = r; |
126 |
relation_transpose (relation *R_arg, int n) |
relation_transpose (relation *R_arg, int n) |
127 |
{ |
{ |
128 |
/* The result. */ |
/* The result. */ |
129 |
relation new_R = XCALLOC (relation_nodes, n); |
relation new_R = CALLOC (new_R, n); |
130 |
/* END_R[I] -- next entry of NEW_R[I]. */ |
/* END_R[I] -- next entry of NEW_R[I]. */ |
131 |
relation end_R = XCALLOC (relation_nodes, n); |
relation end_R = CALLOC (end_R, n); |
132 |
/* NEDGES[I] -- total size of NEW_R[I]. */ |
/* NEDGES[I] -- total size of NEW_R[I]. */ |
133 |
int *nedges = XCALLOC (int, n); |
int *nedges = CALLOC (nedges, n); |
134 |
int i, j; |
int i, j; |
135 |
|
|
136 |
if (trace_flag & trace_sets) |
if (trace_flag & trace_sets) |
149 |
for (i = 0; i < n; i++) |
for (i = 0; i < n; i++) |
150 |
if (nedges[i] > 0) |
if (nedges[i] > 0) |
151 |
{ |
{ |
152 |
relation_node *sp = XCALLOC (relation_node, nedges[i] + 1); |
relation_node *sp = CALLOC (sp, nedges[i] + 1); |
153 |
sp[nedges[i]] = -1; |
sp[nedges[i]] = -1; |
154 |
new_R[i] = sp; |
new_R[i] = sp; |
155 |
end_R[i] = sp; |
end_R[i] = sp; |