Priority queue: Difference between revisions
Content deleted Content added
Line 279:
i = 1;
while (i!=h->len+1) {
k =
j = 2 * i;
if (j <= h->len && h->nodes[j].priority < h->nodes[k].priority) {
Line 288:
k = j + 1;
}
h->nodes[i] = h->nodes[k];
i = k;
}
|