| 62 | } |
| 63 | |
| 64 | void priorityqueue_init(struct priorityqueue *q) { |
| 65 | const size_t max_num_nodes = tal_count(q->value); |
| 66 | q->heapsize = 0; |
| 67 | for (size_t i = 0; i < max_num_nodes; ++i) { |
| 68 | q->value[i] = INFINITE; |
| 69 | q->heapptr[i] = NULL; |
| 70 | } |
| 71 | } |
| 72 | size_t priorityqueue_size(const struct priorityqueue *q) { return q->heapsize; } |
| 73 | |
| 74 | size_t priorityqueue_maxsize(const struct priorityqueue *q) { |
no outgoing calls