# A Comparison of Dijkstra's Algorithm Using Fibonacci Heaps, Binary Heaps, and Self-Balancing Binary Trees

arXiv: https://arxiv.org/abs/2303.10034 · HTML: https://mlsanity.com/paper/2303.10034/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 17 Mar 2023.

## Built on by (most cited first, 1 of 1)

- [Learning-Augmented Priority Queues](https://mlsanity.com/paper/2406.04793/) (2024)

## Abstract (arXiv)

This paper describes the shortest path problem in weighted graphs and examines the differences in efficiency that occur when using Dijkstra's algorithm with a Fibonacci heap, binary heap, and self-balancing binary tree. Using C++ implementations of these algorithm variants, we find that the fastest method is not always the one that has the lowest asymptotic complexity. Reasons for this are discussed and backed with empirical evidence.