[boost] Boost Graph Library: Longest path using Dijkstra's

From: Ramprasad Natrajan (ramkaka_at_[hidden])
Date: 2004-01-03 05:48:34

Hey,

I am new to the boost graph libraries. I was trying to find the longest path 
in a DAG using the dijkstra's algorithm. I used the following syntax:

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 defined to be larger than the largest sum of distances but 
much less than max numeric limit. But, this doesn't seem to do the trick. 
Anyone have any suggestions?

Thanks a lot,

Ram

_________________________________________________________________
Free drafts to 700 locations. 
http://server1.msn.co.in/msnleads/suvidha/dec03.asp?type=hottag Click here.