FibonacciHeapTElementMerge Method

public void Merge(
	FibonacciHeap<TElement> toMerge
)

Public Sub Merge ( 
	toMerge As FibonacciHeap(Of TElement)
)

Merge of two fibonacci heaps is considered O(1). This heap implementation keeps some datastructures for quickly finding elements back. Although these datastructures have an O(1) insert performance characteristic, it can be that the merge performance of this implementation is actually slightly less efficient than O(1) with large heaps

This routine merges objects inside toMerge into this object. This means that this object will have references to objects inside toMerge. It's therefore not recommended to alter toMerge after this operation.