Priority queue: Difference between revisions

Content added Content deleted

Inline

@@ Line 1,631: / Line 1,631: @@
 #include <stdlib.h>
 #include "pairheap.h"
+/* ---------------------------------------------------------------------------
+ * Pairing heap implementation
+ * --------------------------------------------------------------------------- */
 static heap_t add_child(heap_t h, heap_t g) {
     if (h->down != NULL)
-	g->next = h->down;
+        g->next = h->down;
     h->down = g;
 }
@@ Line 1,642: / Line 1,646: @@
     if (b == NULL) return a;
     if (a->key < b->key) {
-	add_child(a, b);
+        add_child(a, b);
-	return a;
+        return a;
     } else {
-	add_child(b, a);
+        add_child(b, a);
-	return b;
+        return b;
     }
 }
@@ Line 1,655: / Line 1,659: @@
 heap_t two_pass_merge(heap_t h) {
     if (h == NULL || h->next == NULL)
-	return h;
+        return h;
     else {
-	pq_node_t
+        pq_node_t
-	    *a = h,
+            *a = h,
-	    *b = h->next,
+            *b = h->next,
-	    *rest = b->next;
+            *rest = b->next;
-	a->next = b->next = NULL;
+        a->next = b->next = NULL;
-	return heap_merge(heap_merge(a, b), two_pass_merge(rest));
+        return heap_merge(heap_merge(a, b), two_pass_merge(rest));
     }
 }
@@ Line 1,702: / Line 1,706: @@
     while (heap != NULL) {
-	struct task *top = (struct task *) heap;
+        struct task *top = (struct task *) heap;
-	printf("%s\n", top->task);
+        printf("%s\n", top->task);
-	heap = heap_pop(heap);
+        heap = heap_pop(heap);
-	free(top);
+        free(top);
     }
 }