[Python] Comparison among the Pure Dijkstra Algorithm and the Optimised Dijkstra Algorithm...

I'm a freshman learning the algorithm. I learnt that there're 3 categories of dijkstra algorithm with different implement methods of data structure, including the pure dijkstra algorithm, optimized with binary heap and optimized with fibonacci heap.

I'm trying to figure out the time complexity of these three methods, and how to realize them in python. Is there any difference applying them in the scientific research or specific industry?

Continue reading...