given a heap, the heapsize and a node in the heap, this function reorders the elements in a top down fashion by moving down the heap and swapping the current node with the smaller of its two children (provided a child is larger than the current node)
source not stored for this graph (policy: none)