Libraries
A priority queue is often considered to be a "container data structure".
The Standard Template Library (STL), and the C++ 1998 standard, specifies priority_queue as one of the STL container adaptor class templates. It implements a max-priority-queue. Unlike actual STL containers, it does not allow 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) also have an implementation in the library heap.
Python's heapq module implements a binary min-heap on top of a list.
Java's library contains a PriorityQueue class, which implements a min-priority-queue.
Go's library contains a container/heap module, which implements a min-heap on top of any compatible data structure.
The Standard PHP Library extension contains the class SplPriorityQueue.
Apple's Core Foundation framework contains a CFBinaryHeap structure, which implements a min-heap.
Read more about this topic: Priority Queue
Famous quotes containing the word libraries:
“To me, nothing can be more important than giving children books, It’s better to be giving books to children than drug treatment to them when they’re 15 years old. Did it ever occur to anyone that if you put nice libraries in public schools you wouldn’t have to put them in prisons?”
—Fran Lebowitz (20th century)
“riding flatcars to Fresno,
Across the whole country
Steep towns, flat towns, even New York,
And oceans and Europe & libraries & galleries
And the factories they make rubbers in”
—Gary Snyder (b. 1930)