void *dfh_delete(DFibHeap * h, DFibHeapNode * x)
{
void *k;
k = x->dfhe_data;
dfh_replacekey(h, x, INT_MIN);
dfh_extractmin(h);
return k;
}
// Removes the node with the shortest key, then returns it.
unsigned int removeNextNodeFromDHeap ( DFibHeap * heap )
{
unsigned int node;
node = ( unsigned int ) dfh_extractmin ( heap );
return node;
}