95641c8aaf
* Create README.fr-FR.md * Translate to french "Priority Queue" module * Add english lang redirection * Update README.fr-FR.md * Update README.fr-FR.md * Add French lang version redir * Create README.fr-FR.md * Added french translation for Queue * Added French lang redir * Update README.md * Create README.fr-FR.md * Add french translation * Index french translation * Create README.fr-FR.md * Add french translation * Index french translation * Fix translation * Create README.fr-FR.md * Add french translation * Index french translation * Add wikipedia french reference * Add french wikipedia reference
Priority Queue
Read this in other languages: 简体中文, Русский, 日本語, Français, Português
In computer science, a priority queue is an abstract data type which is like a regular queue or stack data structure, but where additionally each element has a "priority" associated with it. In a priority queue, an element with high priority is served before an element with low priority. If two elements have the same priority, they are served according to their order in the queue.
While priority queues are often implemented with heaps, they are conceptually distinct from heaps. A priority queue is an abstract concept like "a list" or "a map"; just as a list can be implemented with a linked list or an array, a priority queue can be implemented with a heap or a variety of other methods such as an unordered array.