An AF-heap, or "Amortized Fibonacci heap," is a data structure that is an enhancement and a variant of the Fibonacci heap. The AF-heap supports priority queue operations with better amortized time complexity for specific operations. It is particularly useful in applications such as graph algorithms, where efficient priority queue operations are crucial.
Articles by others on the same topic
There are currently no matching articles.