# Fastest data structure for a priority queue

**URL:** <https://discourse.julialang.org/t/fastest-data-structure-for-a-priority-queue/68472>\
**Category:** Performance\
**Tags:** data\_structures\
**Created:** [September 20, 2021, 3:25pm UTC](https://discourse.julialang.org/t/fastest-data-structure-for-a-priority-queue/68472 "2021-09-20T15:25:40Z")\
**Posts on this page:** 1\
**Showing post:** 5

<div class="post-metadata">

**Author:** ![Bardo](https://sea2.discourse-cdn.com/julialang/user_avatar/discourse.julialang.org/bardo/32/21601_2.png) [@Bardo](https://discourse.julialang.org/u/Bardo)\
**Post date:** [September 20, 2021, 4:15pm UTC](https://discourse.julialang.org/t/fastest-data-structure-for-a-priority-queue/68472/5 "2021-09-20T16:15:55Z")

</div>

See

> [@Create an empty array, then insert (Priority Queue)](https://discourse.julialang.org/t/create-an-empty-array-then-insert-priority-queue/63425/6):
>
> [http://juliacollections.github.io/DataStructures.jl/v0.11/priority-queue.html](http://juliacollections.github.io/DataStructures.jl/v0.11/priority-queue.html)
> 
> It requires unique priority keys, however (which is a bit annoying to be honest).

---

_[View the full topic](https://discourse.julialang.org/t/fastest-data-structure-for-a-priority-queue/68472)._