54 for (i = 1; i <=
PQcnt; i++) {
69 while (
N_VAL(n =
pq[next]) < v) {
111 if (v >=
N_VAL(n))
break;
150 fprintf (stderr,
"Q: ");
151 for (i = 1; i <=
PQcnt; i++) {
153 fprintf (stderr,
"%d(%d:%d) ",
156 fprintf (stderr,
"\n");
Memory allocation wrappers that exit on failure.
static void * gv_calloc(size_t nmemb, size_t size)
void PQupdate(snode *n, int d)
void agerrorf(const char *fmt,...)
snode priority queue for shortPath in sgraph
a node of search graph sgraph, is created as a border segment between two adjusted cells of type cell...