Extracted from Pike v7.6 release 93 at 2006-10-04.
pike.ida.liu.se
[Top]
ADT
ADT.Heap

Class ADT.Heap

Description

This class implements a (min-)heap. The value of a child node will always be greater than or equal to the value of its parent node. Thus, the top node of the heap will always hold the smallest value.