2 Feb
2012
2 Feb
'12
6:45 a.m.
Jeremiah Willcock wrote:
Look at <boost/graph/detail/d_ary_heap.hpp> as well and see if that helps you; you'll need to look at <boost/graph/dijkstra_shortest_paths.hpp> for examples of how to use it.
Great! I hope this will become public interface. One concern is that the implementation is specialized for monotonically decreasing costs (distances in shortest-path problems). In my applications, the cost can be increased. Regards, Michel