文件排名配对堆.pdfVIP

SIAM J. COMPUT. c 2011 Society for Industrial and Applied Mathematics Vol. 40, No. 6, pp. 1463–1485 RANK-PAIRING HEAPS∗ BERNHARD HAEUPLER†, SIDDHARTHA SEN‡, AND ROBERT E. TARJAN§ . We introduce the rank-pairing heap, an implementation of heaps that combines the asymptotic efficiency of Fibonacci heaps with much of the simplicity of pairing heaps. Other heap implementations that match the bounds of Fib