Category:Fibonacci heap

From LiteratePrograms
Jump to: navigation, search

A Fibonacci heap is a concrete heap data structure that is efficient in practice and provides constant amortized time bounds for several important operations: it can insert a node, find the minimum value, decrease a node's key, and union two heaps in amortized constant time; deleting a key still requires O(log n) time.

This category currently contains no pages or media.