359
397
* Return edge, if any, between t and h with given key.
400
Agedge_t *isEdge(Agraph_t* g, Agnode_t * t, Agnode_t * h, char *key)
405
root = sameG(t, h, "isEdge", "tail and head node");
413
return agedge(g, t, h, key, 0);
366
415
if ((root = sameG(t, h, "isEdge", "tail and head node"))) {
367
416
t = (Agnode_t *) agrebind(root, OBJ(t));
368
417
h = (Agnode_t *) agrebind(root, OBJ(h));
369
418
return agedge(t, h, key, 0);