A benchmarking framework for priority queue variants (binary, hollow, Fibonacci, and pairing heaps) under different workloads of Dijkstra's shortest path algorithm.
priority-queue binary-heap benchmark-framework pairing-heap dijkstra-algorithm fibonacci-heap hollow-heap
-
Updated
Nov 6, 2025 - Python