… 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
Faster updates in a priority queue Performance	4	534	January 14, 2021
How to turn this code snippet into a "callable struct with functions"? New to Julia function	4	483	June 25, 2021
Priority queue choice Performance	24	3175	September 1, 2022
PriorityQueue and containers Data	3	2232	July 12, 2017
A priority queue with a vector of priorities General Usage	1	659	May 29, 2019

Fastest data structure for a priority queue

Related topics