165 |
|
double d; |
166 |
|
int p[4]; |
167 |
|
int i, j; |
168 |
– |
|
169 |
– |
if ((x0 == x1) & (y0 == y1)) |
170 |
– |
return(0.); |
168 |
|
/* check radius */ |
169 |
|
p[0] = x0; p[1] = y0; p[2] = x1; p[3] = y1; |
170 |
|
for (i = 4; i--; ) { |
397 |
|
for (newmig = from_rbf->ejl; newmig != NULL; |
398 |
|
newmig = nextedge(from_rbf,newmig)) |
399 |
|
if (newmig->rbfv[1] == to_rbf) |
403 |
– |
{fprintf(stderr, "Edge already exists!\n"); |
400 |
|
return(NULL); |
405 |
– |
} |
401 |
|
/* else allocate */ |
402 |
|
#ifdef DEBUG |
403 |
|
fprintf(stderr, "Building path from (theta,phi) (%.1f,%.1f) ", |