GitHub / mehulthakral / dijkstra-using-different-heaps

Implemented Dijkstra’s algorithm and compared performance when implemented using fibonacci, binomial and binary heaps in CPP. Ran algorithm on New York’s road network dataset which consisted of around 0.2M nodes and 0.7M edges. Concluded that fibonacci Heap gives performance enhancement on such a large dataset compared to other two heaps.

JSON API: http://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/mehulthakral%2Fdijkstra-using-different-heaps

Topics: binary-heap, binomial-heap, cpp, dijkstra-shortest-path, fibonacci-heap, newyork-roadnetwork-dataset

• Files
• Readme
• Dependencies