Boost logo

Boost :

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


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>(),

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,


Free drafts to 700 locations. Click here.

Boost list run by bdawes at, gregod at, cpdaniel at, john at