Framework for testing Dijkstra algorithm
Latest commit 609dba0 Feb 18, 2015 @gabormakrai Update

Framework for testing Dijkstra's algorithm

This project aims to measure the performance of different implementation of one of the most known single source shortest path algorithm, Dijkstra's shortest path algorithm. I am considering the naive, priority queue with binary heap and priority queue with Fibonacci heap type implementations where I am using existing open-source implementation of the Fibonacci heap. My goal with this experiment is to show different implementation's strength and also to investigate the performance of existing open-source Fibonacci heap implementations. All the theoretical knowledge can be found in CLRS 24.3 and CLRS 19. To get deeper understanding on the measurement, I have decided to split the text into 4 parts:

Parallel to this GitHub repository, I have created a post on my blog. Feel free to visit the post following this link: