Pairing heap
id:
pairing-heap-235-13620022
title:
Pairing heap
text:
A pairing heap is a type of heap data structure with relatively simple implementation and excellent practical amortized performance, introduced by Michael Fredman, Robert Sedgewick, Daniel Sleator, and Robert Tarjan in 1986.
Pairing heaps are heap-ordered multiway tree structures, and can be considered simplified Fibonacci heaps. They are considered a "robust choice" for implementing such algorithms as Prim's MST algorithm, and support the following operations: find-min: simply return the top el
brand slug:
wiki
category slug:
encyclopedia
description:
Variant of heap data structure
original url:
https://en.wikipedia.org/wiki/Pairing_heap
date created:
date modified:
2024-04-25T12:21:07Z
main entity:
{"identifier":"Q17152481","url":"https://www.wikidata.org/entity/Q17152481"}
image:
fields total:
13
integrity:
14