/*
* Private Heap Functions
*/
static void
fh_deleteel(struct fibheap *h, struct fibheap_el *x)
{
void *data;
int key;
data = x->fhe_data;
key = x->fhe_key;
if (!h->fh_keys)
fh_replacedata(h, x, h->fh_neginf);
else
fh_replacekey(h, x, INT_MIN);
if (fh_extractminel(h) != x) {
/*
* XXX - This should never happen as fh_replace should set it
* to min.
*/
abort();
}
x->fhe_data = data;
x->fhe_key = key;
}
// Replaces the key for a given node
Coordinate replaceKeyInHeap(FibHeap * heap, FibHeapNode * node,
Coordinate newKey)
{
return fh_replacekey(heap, node, newKey);
}
int main(void)
{
struct fibheap *a;
void *arr[10];
int i;
a = fh_makekeyheap();
for (i=1 ; i < 8 ; i++)
{
arr[i]= fh_insertkey(a,0,(void *)i);
printf("adding: 0 %d \n",i);
}
printf(" \n");
fh_replacekey(a, arr[1],-2);
fh_replacekey(a, arr[4],-3);
fh_replacekey(a, arr[7],-5);
printf("Wert(minkey) %d\n",fh_minkey(a));
printf("Knoten: %d\n\n", (int)fh_extractmin(a));
fh_replacekey(a, arr[3],-2);
fh_replacekey(a, arr[6],-1);
printf("Wert(minkey) %d\n",fh_minkey(a));
printf("Knoten: %d\n\n", (int)fh_extractmin(a));
fh_replacekey(a, arr[1],-9);
fh_replacekey(a, arr[5],-3);
printf("Wert(minkey) %d\n",fh_minkey(a));
printf("Knoten: %d\n\n", (int)fh_extractmin(a));
fh_replacekey(a, arr[2],-4);
fh_replacekey(a, arr[5],-5);
fh_replacekey(a, arr[6],-3);
printf("Wert(minkey) %d\n",fh_minkey(a));
printf("Knoten: %d\n\n", (int)fh_extractmin(a));
fh_replacekey(a, arr[2],-6);
fh_replacekey(a, arr[6],-6);
printf("Wert(minkey) %d\n",fh_minkey(a));
printf("Knoten: %d\n\n", (int)fh_extractmin(a));
printf("Wert(minkey) %d\n",fh_minkey(a));
printf("Knoten: %d\n\n", (int)fh_extractmin(a));
printf("Wert(minkey) %d\n",fh_minkey(a));
printf("Knoten: %d\n\n", (int)fh_extractmin(a));
fh_deleteheap(a);
return 0;
}
int
main(void) {
struct fibheap *a;
void *arr[10];
int i;
a = fh_makekeyheap();
for (i=1 ; i < 10 ; i++)
{
arr[i]= fh_insertkey(a,0,int_to_pointer(i));
printf("adding: 0 %d \n",i);
}
printf(" \n");
fh_replacekey(a, arr[1],-38);
fh_replacekey(a, arr[7],-34);
printf("wert(minkey) %d\n",fh_minkey(a));
printf("Knoten: %lld\n\n", pointer_to_ll(fh_extractmin(a)));
fh_replacekey(a, arr[2],-55);
fh_replacekey(a, arr[5],-56);
printf("Wert(minkey) %d\n",fh_minkey(a));
printf("Knoten: %lld\n\n", pointer_to_ll(fh_extractmin(a)));
fh_replacekey(a, arr[4],-1);
fh_replacekey(a, arr[2],-102);
fh_replacekey(a, arr[6],-1);
fh_replacekey(a, arr[9],-1);
fh_replacekey(a, arr[8],-4);
printf("Wert(minkey) %d\n",fh_minkey(a));
printf("Knoten: %lld\n\n", pointer_to_ll(fh_extractmin(a)));
fh_replacekey(a, arr[3],-74);
fh_replacekey(a, arr[8],-55);
fh_replacekey(a, arr[4],-2);
printf("Wert(minkey) %d\n",fh_minkey(a));
printf("Knoten: %lld\n\n", pointer_to_ll(fh_extractmin(a)));
fh_replacekey(a, arr[4],-3);
fh_replacekey(a, arr[6],-2);
fh_replacekey(a, arr[7],-99);
printf("Wert(minkey) %d\n",fh_minkey(a));
printf("Knoten: %lld\n\n", pointer_to_ll(fh_extractmin(a)));
fh_replacekey(a, arr[6],-3);
fh_replacekey(a, arr[4],-4);
fh_replacekey(a, arr[8],-94);
fh_replacekey(a, arr[9],-2);
printf("Wert(minkey) %d\n",fh_minkey(a));
printf("Knoten: %lld\n\n", pointer_to_ll(fh_extractmin(a)));
fh_replacekey(a, arr[6],-4);
printf("Wert(minkey) %d\n",fh_minkey(a));
printf("Knoten: %lld\n\n", pointer_to_ll(fh_extractmin(a)));
printf("Wert(minkey) %d\n",fh_minkey(a));
printf("Knoten: %lld\n\n", pointer_to_ll(fh_extractmin(a)));
/*fh_replacekey(a, arr[9],-3);*/
printf("Wert(minkey) %d\n",fh_minkey(a));
printf("Knoten: %lld\n\n", pointer_to_ll(fh_extractmin(a)));
/*fh_replacekey(a, arr[9],-49);*/
fh_deleteheap(a);
return 0;
}
int main(void)
{
struct fibheap *a;
void *arr[10];
int i;
a = fh_makekeyheap();
for (i=1 ; i < 10 ; i++)
{
arr[i]= fh_insertkey(a,0,(void *)i);
printf("adding: 0 %d \n",i);
}
printf(" \n");
fh_replacekey(a, arr[1],-1);
fh_replacekey(a, arr[6],-1);
fh_replacekey(a, arr[4],-1);
fh_replacekey(a, arr[2],-1);
fh_replacekey(a, arr[8],-1);
printf("value(minkey) %d\n",fh_minkey(a));
printf("id: %d\n\n", (int)fh_extractmin(a));
fh_replacekey(a, arr[7],-33);
/* -> node 7 becomes root node, but is still pointed to by node 6 */
fh_replacekey(a, arr[4],-36);
fh_replacekey(a, arr[3],-1);
fh_replacekey(a, arr[9],-81);
printf("value(minkey) %d\n",fh_minkey(a));
printf("id: %d\n\n", (int)fh_extractmin(a));
fh_replacekey(a, arr[6],-68);
fh_replacekey(a, arr[2],-69);
printf("value(minkey) %d\n",fh_minkey(a));
printf("id: %d\n\n", (int)fh_extractmin(a));
fh_replacekey(a, arr[1],-52);
fh_replacekey(a, arr[3],-2);
fh_replacekey(a, arr[4],-120);
fh_replacekey(a, arr[5],-48);
printf("value(minkey) %d\n",fh_minkey(a));
printf("id: %d\n\n", (int)fh_extractmin(a));
fh_replacekey(a, arr[3],-3);
fh_replacekey(a, arr[5],-63);
printf("value(minkey) %d\n",fh_minkey(a));
printf("id: %d\n\n", (int)fh_extractmin(a));
fh_replacekey(a, arr[5],-110);
fh_replacekey(a, arr[7],-115);
printf("value(minkey) %d\n",fh_minkey(a));
printf("id: %d\n\n", (int)fh_extractmin(a));
fh_replacekey(a, arr[5],-188);
printf("value(minkey) %d\n",fh_minkey(a));
printf("id: %d\n\n", (int)fh_extractmin(a));
fh_replacekey(a, arr[3],-4);
printf("value(minkey) %d\n",fh_minkey(a));
printf("id: %d\n\n", (int)fh_extractmin(a));
printf("value(minkey) %d\n",fh_minkey(a));
printf("id: %d\n\n", (int)fh_extractmin(a));
fh_deleteheap(a);
return 0;
}
