File PriorityQueue.h

↰ Parent directory (ADS/priority)

The PRIORITYQUEUE of section 10.1, with decreasing priority: insert( x , p ) gives a handle of x, min() and deleteMin() the item of smallest priority, decrease( y , p ) lowers to p the priority of the item of the handle y.

Definition (ADS/priority/PriorityQueue.h)

Detailed Description

Items of equal priority leave in no given order.

HeapPriorityQueue realizes it on a d-ary heap, ListPriorityQueue on a sorted or unsorted list, TreePriorityQueue on a Red-Black tree.

  1. Montresor, Algoritmi e Strutture Dati, 2025, section 10.1, https://algoritmicamente.it/materiali/libro/capitoli/cap10.pdf

Donato Meoli

Dipartimento di Informatica Universita’ di Pisa

by Donato Meoli

Includes

Included By

Namespaces