Construct · 1 fields · 2 citations

meld: a standalone construct

One name. One construct. A landmark on the map.

● anchor · a standalone construct Nearest construct by meaning·not indexed
meld1 CONSTRUCTHeap meldTARJAN · HEAP MELD

A single standalone construct; nearby constructs are located against it in the Collider. Tap a field for its definition, unit, and measures.

Data structures

Combining two priority queues into one

In data structures a meld is the operation that combines two heaps, or priority queues, into a single heap holding all their elements, the defining capability of a meldable (mergeable) heap. Fredman and Tarjan's 1987 Fibonacci heaps and their uses in improved network optimization algorithms presents a structure whose meld runs in constant amortized time, and Cormen and colleagues' Introduction to algorithms (2009) covers meldable heaps and their union operation. The referent is an algorithmic operation with a cost bound, and it is unrelated to a card-game combination beyond the shared word.[1][2]

Unit
The operation merging two priority queues into one
Recovery means
Not applicable
Measured by
Characterized by its time complexity, such as constant amortized time for a Fibonacci-heap meld

Next

Run it through the Collider, or take the citations with you.

See how meld sits against neighbouring constructs in the Collider, or export every reference on this page in one click.

Open in ColliderExport BibTeXReport this entry

Nearby constructs

capability4 fields · 8 citationsjingle · one word, four constructscombination1 fields · 2 citationsanchor · a standalone construct

References

  1. Fredman, M. L., & Tarjan, R. E. (1987). Fibonacci heaps and their uses in improved network optimization algorithms. Journal of the ACM, 34(3), 596–615. https://doi.org/10.1145/28869.28874
  2. Cormen, T. H., Leiserson, C. E., Rivest, R. L., & Stein, C. (2009). Introduction to algorithms (3rd ed.). MIT Press. ISBN 9780262033848

Cited on this page?

Confirm your construct, or correct us.

If your work is cited behind one of these entries, you know better than we do whether we captured the meaning right. Confirm it, suggest an edit, or dispute it, and your name goes on the entry as an author who has checked it, linked to your ORCID.

Claim your construct