imported>Squeakachu: Rollback edit(s) by ~2025-32162-13 (talk): non-constructive (RW 16.1)

2025-11-10T07:05:05Z

Rollback edit(s) by ~2025-32162-13 (talk): non-constructive (RW 16.1)

imported>OAbot: Open access bot: url-access updated in citation with #oabot.

2025-06-19T21:16:48Z

Open access bot: url-access updated in citation with #oabot.

← Previous revision		Revision as of 21:16, 19 June 2025
Line 9:		Line 9:
	== Operations ==		== Operations ==

	A priority queue has the following operations:<ref>{{Introduction to Algorithms\|edition=4\|chapter=Chapter 6.5: Priority queues\|pages=172–176}}</ref><ref name=":1">{{Cite journal \|last1=Rönngren \|first1=Robert \|last2=Ayani \|first2=Rassul \|date=1997-04-01 \|title=A comparative study of parallel and sequential priority queue algorithms \|url=https://dl.acm.org/doi/10.1145/249204.249205 \|journal=ACM Trans. Model. Comput. Simul. \|volume=7 \|issue=2 \|pages=157–209 \|doi=10.1145/249204.249205 \|issn=1049-3301}}</ref><ref name=":2">{{Cite book \|last=Ayani \|first=R. \|chapter=LR-algorithm: Concurrent operations on priority queues \|date=December 1990 \|title=Proceedings of the Second IEEE Symposium on Parallel and Distributed Processing 1990 \|chapter-url=https://ieeexplore.ieee.org/document/143500 \|pages=22–25 \|doi=10.1109/SPDP.1990.143500\|isbn=0-8186-2087-0 }}</ref>		A priority queue has the following operations:<ref>{{Introduction to Algorithms\|edition=4\|chapter=Chapter 6.5: Priority queues\|pages=172–176}}</ref><ref name=":1">{{Cite journal \|last1=Rönngren \|first1=Robert \|last2=Ayani \|first2=Rassul \|date=1997-04-01 \|title=A comparative study of parallel and sequential priority queue algorithms \|url=https://dl.acm.org/doi/10.1145/249204.249205 \|journal=ACM Trans. Model. Comput. Simul. \|volume=7 \|issue=2 \|pages=157–209 \|doi=10.1145/249204.249205 \|issn=1049-3301\|url-access=subscription }}</ref><ref name=":2">{{Cite book \|last=Ayani \|first=R. \|chapter=LR-algorithm: Concurrent operations on priority queues \|date=December 1990 \|title=Proceedings of the Second IEEE Symposium on Parallel and Distributed Processing 1990 \|chapter-url=https://ieeexplore.ieee.org/document/143500 \|pages=22–25 \|doi=10.1109/SPDP.1990.143500\|isbn=0-8186-2087-0 }}</ref>

	{{div col\|colwidth=20em}}		{{div col\|colwidth=20em}}
Line 160:		Line 160:
	A priority queue is often considered to be a "[[container (abstract data type)\|container data structure]]".		A priority queue is often considered to be a "[[container (abstract data type)\|container data structure]]".

	The [[Standard Template Library]] (STL), and the [[C++]] 1998 standard, specifies [https://en.cppreference.com/w/cpp/container/priority_queue std::priority_queue] as one of the STL [[container (programming)\|container]] [[adaptor (programming)\|adaptor]] [[Template (programming)\|class template]]s. However, it does not specify how two elements with same priority should be served, and indeed, common implementations will not return them according to their order in the queue. It implements a max-priority-queue, and has three parameters: a comparison object for sorting such as a function object (defaults to less<T> if unspecified), the underlying container for storing the data structures (defaults to std::vector<T>), and two iterators to the beginning and end of a sequence. Unlike actual STL containers, it does not allow [[Iterator\|iteration]] of its elements (it strictly adheres to its abstract data type definition). STL also has utility functions for manipulating another random-access container as a binary max-heap. The [[Boost (C++ libraries)\|Boost libraries]] also have an implementation in the library heap.		The [[Standard Template Library]] (STL), and the [[C++]] 1998 standard, specifies [https://en.cppreference.com/w/cpp/container/priority_queue std::priority_queue] as one of the STL [[container (programming)\|container]] [[adaptor (programming)\|adaptor]] [[Template (programming)\|class template]]s. However, it does not specify how two elements with same priority should be served, and indeed, common implementations will not return them according to their order in the queue. It implements a max-priority-queue, and has three parameters: a comparison object for sorting such as a function object (defaults to {{Mono\|less<T>}} if unspecified), the underlying container for storing the data structures (defaults to {{Mono\|std::vector<T>}}), and two iterators to the beginning and end of a sequence. Unlike actual STL containers, it does not allow [[Iterator\|iteration]] of its elements (it strictly adheres to its abstract data type definition). STL also has utility functions for manipulating another random-access container as a binary max-heap. The [[Boost (C++ libraries)\|Boost libraries]] also have an implementation in the library heap.

	Python's [https://docs.python.org/library/heapq.html heapq] module implements a binary min-heap on top of a list.		Python's [https://docs.python.org/library/heapq.html heapq] module implements a binary min-heap on top of a list.

imported>Citation bot: Alter: title, template type. Add: isbn, chapter-url, chapter, doi, pages, volume, authors 1-1. Removed or converted URL. Removed parameters. Some additions/deletions were parameter name changes. | Use this bot. Report bugs. | Suggested by Headbomb | Linked from Wikipedia:WikiProject_Academic_Journals/Journals_cited_by_Wikipedia/Sandbox2 | #UCB_webform_linked 392/552

2025-04-25T23:32:20Z

Alter: title, template type. Add: isbn, chapter-url, chapter, doi, pages, volume, authors 1-1. Removed or converted URL. Removed parameters. Some additions/deletions were parameter name changes. | Use this bot. Report bugs. | Suggested by Headbomb | Linked from Wikipedia:WikiProject_Academic_Journals/Journals_cited_by_Wikipedia/Sandbox2 | #UCB_webform_linked 392/552

Show changes

Priority queue - Revision history

imported>Squeakachu: Rollback edit(s) by ~2025-32162-13 (talk): non-constructive (RW 16.1)

imported>OAbot: Open access bot: url-access updated in citation with #oabot.