jkstra icon indicating copy to clipboard operation
jkstra copied to clipboard

Published 20 hours ago • verified publisher icon bbecquet

Priority Queue

Open sfwhite opened this issue 3 years ago • 0 comments

Have you considered switching out from your own priority queue implementation to a Fibonacci Heap implementation? FH has one of the best amortized runtimes for Dijkstra implementations.

The mnemonist library has an implementation that's stable.

sfwhite avatar Jan 01 '22 07:01 sfwhite