[Boost-users] Longest path in a DAG using BGL

From: Ramprasad Natrajan (ramkaka_at_[hidden])
Date: 2004-01-03 06:00:29

Hi,

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[0], &d[0], weightmap, indexmap,
                          std::greater<int>(), closed_plus<int>(),
                          0,MAXINT,dijkstra_visitor<null_visitor>());

  where MAXINT is set high enough to be greater than the maximum path 
length.

This doesn't seem to do the trick. Any suggestions?

Thanks a real lot,

Ram

_________________________________________________________________
Feeling like a vacation? Then you are in the right place. 
http://www.msn.co.in/Travel/ Get the best travel deals here!