37 extern void printNodelist(nodelist_t * list);
#define DEFINE_LIST(name, type)
void reverseAppend(nodelist_t *, nodelist_t *)
Create l1 @ (rev l2) Destroys and frees l2.
void realignNodelist(nodelist_t *list, size_t np)
Make np new front of list, with current last hooked to current first.
void insertNodelist(nodelist_t *, Agnode_t *, Agnode_t *, int)
void appendNodelist(nodelist_t *, size_t, Agnode_t *n)
Add node after one.