Version 5.0 The LEDA User Manual

const P & Q.inf(node v) returns the priority of node v.
4. Implementation
Node priority queues are implemented by binary heaps and node arrays. Operations
insert, del node, del min, decrease p take time O(log m), find min and empty take time
O(1) and clear takes time O(m), where m is the size of Q. The space requirement is O(n),
where n is the number of nodes of G.