Monotone priority queue
id:
monotone-priority-queue-301-15473551
title:
Monotone priority queue
text:
In computer science, a monotone priority queue is a variant of the priority queue abstract data type in which the priorities of extracted items are required to form a monotonic sequence. That is, for a priority queue in which each successively extracted item is the one with the minimum priority, the minimum priority should be monotonically increasing. Conversely for a max-heap the maximum priority should be monotonically decreasing. The assumption of monotonicity arises naturally in several appl
brand slug:
wiki
category slug:
encyclopedia
description:
Abstract data type in computer science
original url:
https://en.wikipedia.org/wiki/Monotone_priority_queue
date created:
date modified:
2023-12-27T07:14:47Z
main entity:
{"identifier":"Q18391020","url":"https://www.wikidata.org/entity/Q18391020"}
image:
fields total:
13
integrity:
14