Linked from

The 7 pages that link to Priority queue, each with the reason it gives.

• Dijkstra's algorithmRelated: It selects the unsettled vertex with the smallest tentative distance.

• Huffman codingRelated: A minimum-priority queue selects the two least-weighted nodes at each merge.

• Total orderRelated: A total order on priorities determines which element is next.

• A* search algorithmRelated: Implementations use it to select the frontier path with the smallest estimated total cost.

• HeapsortRelated: Heapsort applies repeated priority-queue extraction to every input element.

• Prim's algorithmRelated: It efficiently selects the cheapest edge or vertex on the tree's frontier.