Longest path in a DAG using BGL
3 Jan
2004
3 Jan
'04
11 a.m.
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
7633
Age (days ago)
7633
Last active (days ago)
0 comments
1 participants
participants (1)
-
Ramprasad Natrajan