… depends on the number of events to be handled. I could not use the PQs I’ve seen in Julia because they did not handle multiple identical event times, so took this as an exercise. My events have the following structure: (time, variable_number_and_types_of_args) I see two performance limiting fa…

Thanks @carl-aa . I looked at the theory part (not the implementation), looks like an ordinary binary heap. prioqueue.pdf (wm.edu) pp25 ranks the binary heap among the slowest implementations. It quickly finds the next event in O(log(n)), but then loses out on costly operations to rebalance the tree…

Fastest data structure for a priority queue

General Usage Performance

Bardo September 20, 2021, 4:15pm 5

See

Topic		Replies	Views
Priority queue choice Performance	24	3253	September 1, 2022
Create an empty array, then insert (Priority Queue) New to Julia array	6	1226	June 23, 2021
Faster updates in a priority queue Performance	4	558	January 14, 2021
How to create a priority queue with a certain type of key and priority? General Usage	1	422	May 25, 2019
I want to use a PriorityQueue equivalent with duplicate keys General Usage question , data_structures	4	341	December 14, 2023

Fastest data structure for a priority queue

Related topics