Binary min-heap of ids keyed by priority (ties: insertion order), shared by A* and road growth.
Number of queued entries.
Removes and returns the id with the smallest key.
Queues id with priority key.
id
key
Binary min-heap of ids keyed by priority (ties: insertion order), shared by A* and road growth.