August 1999
Intermediate to advanced
560 pages
18h 57m
English
Collections of heap-ordered trees. Fibonacci heaps are used sometimes in computing minimum spanning trees and finding single-source shortest paths (see Chapter 17).
Heaps built from trees with a branching factor of k. Although not as common as heaps that are binary trees, a k -ary heap may be worth considering for some problems.