I recently ran into a situation where dijkstra_shortest_paths in the boost graph library was running very slowly.  When I replaced the call to dijkstra_shortest_paths with the code below, things were a couple of orders magnitude faster.  Any idea why?