Published March 22, 2023
| Version 2
Dataset
Open
Dijkstra's Algorithm using a Fibonacci Heap, Binary Heap and Self-balancing Binary Tree
Description
Efficient C++ implementation of Dijkstra's algorithm using Fibonacci Heaps, Binary Heaps and Self-balancing Binary Trees. Also contains two .csv data sets from expeiments using directed planar graphs and random graphs of varying densities.
Paper is published at
Lewis, R. (2023), "A Comparison of Dijkstra's Algorithm Using Fibonacci Heaps, Binary Heaps, and Self-Balancing Binary Trees", arXiv:2303.10034, https://doi.org/10.48550/arXiv.2303.10034
Notes
See the following publication for further details Lewis, R. (2023), "A Comparison of Dijkstra's Algorithm Using Fibonacci Heaps, Binary Heaps, and Self-Balancing Binary Trees", arXiv:2303.10034, https://doi.org/10.48550/arXiv.2303.10034
Files
planar.csv
Additional details
Related works
- Is cited by
- Report: 10.48550/arXiv.2303.10034 (DOI)