I am trying to implement the time-dependent version of Dijkstra's Algorithm, and for that I was looking for the boost implementation of Dijkstra. I looked into the dijkstra_shortest_paths.hpp script, but couldn't find the algorithm. Could anyone help me out with it?
I tried implementing Dijkstra's algorithm in Python, but it takes around 40 seconds to find the shortest path for a graph with 38000 nodes. And it gives the result instantaneously using boost for the same graph. I am struggling to understand how boost runs so fast. Is it using some sort of approximate solution, or it gives the optimal solution? Any help would be much appreciated.
Thank you,
Ritwik
If you would like to refer to this comment somewhere else in this project, copy and paste the following link:
Hello Everyone,
I am trying to implement the time-dependent version of Dijkstra's Algorithm, and for that I was looking for the boost implementation of Dijkstra. I looked into the dijkstra_shortest_paths.hpp script, but couldn't find the algorithm. Could anyone help me out with it?
I tried implementing Dijkstra's algorithm in Python, but it takes around 40 seconds to find the shortest path for a graph with 38000 nodes. And it gives the result instantaneously using boost for the same graph. I am struggling to understand how boost runs so fast. Is it using some sort of approximate solution, or it gives the optimal solution? Any help would be much appreciated.
Thank you,
Ritwik