- Forum
- Windows Programming
- Dijkstra in Boost Graph Library(BGL)
Dijkstra in Boost Graph Library(BGL)
Dear all,
Hope all is well. I am working in a USA network to find all the shortest paths. I have used Dijkstra in boost graph.
The problem is, I need to create shortest paths for about 34000 Origin-Destination pairs and I need to do this in a for loop. when I solve the for loop, first OD pair will be solved very quickly but when it keeps going, the time for other OD pairs will increase. The thing is, when I put the OD pair that is in middle of the list in the first OD pair to solve, it takes just 2 seconds to solve. But when i put it for example as 200th OD pair, it takes about 60 seconds to solve. Is there any body here to suggest me some ideas?
Bests,
Esmaeel
Hope all is well. I am working in a USA network to find all the shortest paths. I have used Dijkstra in boost graph.
The problem is, I need to create shortest paths for about 34000 Origin-Destination pairs and I need to do this in a for loop. when I solve the for loop, first OD pair will be solved very quickly but when it keeps going, the time for other OD pairs will increase. The thing is, when I put the OD pair that is in middle of the list in the first OD pair to solve, it takes just 2 seconds to solve. But when i put it for example as 200th OD pair, it takes about 60 seconds to solve. Is there any body here to suggest me some ideas?
Bests,
Esmaeel
Topic archived. No new replies allowed.