[Test] Add Fibonacci heap tests

Author: Nikola Yurukov

fibheap/fibheap_examples_test.go

@@ -0,0 +1,104 @@
+package fibheap
+
+// Tests for the Fibonacci heap with floating point number priorities
+
+import (
+	"fmt"
+)
+
+const SomeNumber float64 = 15.5
+const SomeSmallerNumber float64 = -10.1
+const SomeLargerNumber float64 = 112.211
+
+func ExampleFloatingFibonacciHeap_Enqueue() {
+	heap := NewFloatFibHeap()
+	// The function returns a pointer
+	// to the node that contains the new value
+	node := heap.Enqueue(SomeNumber)
+	fmt.Println(node.priority)
+	// Output: 15.5
+}
+
+func ExampleFloatingFibonacciHeap_Min() {
+	heap := NewFloatFibHeap()
+	heap.Enqueue(SomeNumber)
+	heap.Enqueue(SomeLargerNumber)
+	min, _ := heap.Min()
+	fmt.Println(min.priority)
+	// Output: 15.5
+}
+
+func ExampleFloatingFibonacciHeap_IsEmpty() {
+	heap := NewFloatFibHeap()
+	fmt.Printf("Empty before insert? %v\n", heap.IsEmpty())
+	heap.Enqueue(SomeNumber)
+	fmt.Printf("Empty after insert? %v\n", heap.IsEmpty())
+	// Output:
+	// Empty before insert? true
+	// Empty after insert? false
+}
+
+func ExampleFloatingFibonacciHeap_Size() {
+	heap := NewFloatFibHeap()
+	fmt.Printf("Size before insert: %v\n", heap.Size())
+	heap.Enqueue(SomeNumber)
+	fmt.Printf("Size after insert: %v\n", heap.Size())
+	// Output:
+	// Size before insert: 0
+	// Size after insert: 1
+}
+
+func ExampleFloatingFibonacciHeap_DequeueMin() {
+	heap := NewFloatFibHeap()
+	heap.Enqueue(SomeNumber)
+	node, _ := heap.DequeueMin()
+	fmt.Printf("Dequeueing minimal element: %v\n", node.priority)
+	// Output:
+	// Dequeueing minimal element: 15.5
+}
+
+func ExampleFloatingFibonacciHeap_DecreaseKey() {
+	heap := NewFloatFibHeap()
+	node := heap.Enqueue(SomeNumber)
+	min, _ := heap.Min()
+	fmt.Printf("Minimal element before decreasing key: %v\n", min.priority)
+	heap.DecreaseKey(node, SomeSmallerNumber)
+	min, _ = heap.Min()
+	fmt.Printf("Minimal element after decreasing key: %v\n", min.priority)
+	// Output:
+	// Minimal element before decreasing key: 15.5
+	// Minimal element after decreasing key: -10.1
+}
+
+func ExampleFloatingFibonacciHeap_Delete() {
+	heap := NewFloatFibHeap()
+	node := heap.Enqueue(SomeNumber)
+	heap.Enqueue(SomeLargerNumber)
+	min, _ := heap.Min()
+	fmt.Printf("Minimal element before deletion: %v\n", min.priority)
+	heap.Delete(node)
+	min, _ = heap.Min()
+	fmt.Printf("Minimal element after deletion: %v\n", min.priority)
+	// Output:
+	// Minimal element before deletion: 15.5
+	// Minimal element after deletion: 112.211
+}
+
+func ExampleFloatingFibonacciHeap_Merge() {
+	heap1 := NewFloatFibHeap()
+	heap2 := NewFloatFibHeap()
+	heap1.Enqueue(SomeNumber)
+	heap1.Enqueue(SomeLargerNumber)
+	heap2.Enqueue(SomeSmallerNumber)
+	min, _ := heap1.Min()
+	fmt.Printf("Minimal element of heap 1: %v\n", min.priority)
+	min, _ = heap2.Min()
+	fmt.Printf("Minimal element of heap 2: %v\n", min.priority)
+	heap, _ := heap1.Merge(heap2)
+	min, _ = heap.Min()
+	fmt.Printf("Minimal element of merged heap: %v\n", min.priority)
+	// Output:
+	// Minimal element of heap 1: 15.5
+	// Minimal element of heap 2: -10.1
+	// Minimal element of merged heap: -10.1
+}

fibheap/fibheap_single_example_test.go

@@ -0,0 +1,73 @@
+package fibheap
+
+// Example Test for the Fibonacci heap with floats
+
+import (
+	"fmt"
+)
+
+const SomeNumberAround0 float64 = -0.001
+const SomeLargerNumberAround15 float64 = 15.77
+const SomeNumberAroundMinus1000 float64 = -1002.2001
+const SomeNumberAroundMinus1003 float64 = -1003.4
+
+func Example() {
+	heap1 := NewFloatFibHeap()
+	fmt.Println("Created heap 1.")
+	nodeh1_1 := heap1.Enqueue(SomeLargerNumberAround15)
+	fmt.Printf("Heap 1 insert: %v\n", nodeh1_1.priority)
+
+	heap2 := NewFloatFibHeap()
+	fmt.Println("Created heap 2.")
+	fmt.Printf("Heap 2 is empty? %v\n", heap2.IsEmpty())
+	nodeh2_1 := heap2.Enqueue(SomeNumberAroundMinus1000)
+	fmt.Printf("Heap 2 insert: %v\n", nodeh2_1.priority)
+	nodeh2_2 := heap2.Enqueue(SomeNumberAround0)
+	fmt.Printf("Heap 2 insert: %v\n", nodeh2_2.priority)
+	fmt.Printf("Heap 1 size: %v\n", heap1.Size())
+	fmt.Printf("Heap 2 size: %v\n", heap2.Size())
+	fmt.Printf("Heap 1 is empty? %v\n", heap1.IsEmpty())
+	fmt.Printf("Heap 2 is empty? %v\n", heap2.IsEmpty())
+
+	fmt.Printf("\nMerge Heap 1 and Heap 2.\n")
+	mergedHeap, _ := heap1.Merge(heap2)
+	fmt.Printf("Merged heap size: %v\n", mergedHeap.Size())
+	fmt.Printf("Set node with priority %v to new priority %v\n", SomeNumberAroundMinus1000, SomeNumberAroundMinus1003)
+
+	mergedHeap.DecreaseKey(nodeh2_1, SomeNumberAroundMinus1003)
+	min, _ := mergedHeap.DequeueMin()
+	fmt.Printf("Dequeue minimum of merged heap: %v\n", min.priority)
+	fmt.Printf("Merged heap size: %v\n", mergedHeap.Size())
+
+	fmt.Printf("Delete from merged heap: %v\n", SomeNumberAround0)
+	mergedHeap.Delete(nodeh2_2)
+	fmt.Printf("Merged heap size: %v\n", mergedHeap.Size())
+
+	min, _ = mergedHeap.DequeueMin()
+	fmt.Printf("Extracting minimum of merged heap: %v\n", min.priority)
+	fmt.Printf("Merged heap size: %v\n", mergedHeap.Size())
+	fmt.Printf("Merged heap is empty? %v\n", mergedHeap.IsEmpty())
+
+	// Output:
+	// Created heap 1.
+	// Heap 1 insert: 15.77
+	// Created heap 2.
+	// Heap 2 is empty? true
+	// Heap 2 insert: -1002.2001
+	// Heap 2 insert: -0.001
+	// Heap 1 size: 1
+	// Heap 2 size: 2
+	// Heap 1 is empty? false
+	// Heap 2 is empty? false
+	//
+	// Merge Heap 1 and Heap 2.
+	// Merged heap size: 3
+	// Set node with priority -1002.2001 to new priority -1003.4
+	// Dequeue minimum of merged heap: -1003.4
+	// Merged heap size: 2
+	// Delete from merged heap: -0.001
+	// Merged heap size: 1
+	// Extracting minimum of merged heap: 15.77
+	// Merged heap size: 0
+	// Merged heap is empty? true
+}