21#define N_VAL(n) (n)->n_val
22#define N_IDX(n) (n)->n_idx
23#define N_DAD(n) (n)->n_dad
24#define N_EDGE(n) (n)->n_edge
25#define E_WT(e) (e->weight)
Memory allocation wrappers that exit on failure.
snode * PQremove(pq_t *pq)
void PQupdate(pq_t *pq, snode *n, int d)
int PQ_insert(pq_t *pq, snode *np)
a node of search graph sgraph, is created as a border segment between two adjusted cells of type cell...