Boost Users :
From: Ramprasad Natrajan (ramkaka_at_[hidden])
Date: 2004-01-03 06:00:29
I am trying to find the longest path in a DAG using the BGL Dijkstra
function. The call I used is:
dijkstra_shortest_paths(hcg, s, &p, &d, weightmap, indexmap,
where MAXINT is set high enough to be greater than the maximum path
This doesn't seem to do the trick. Any suggestions?
Thanks a real lot,
Feeling like a vacation? Then you are in the right place.
http://www.msn.co.in/Travel/ Get the best travel deals here!
Boost-users list run by williamkempf at hotmail.com, kalb at libertysoft.com, bjorn.karlsson at readsoft.com, gregod at cs.rpi.edu, wekempf at cox.net