[Boost-users] Graph problem -- solvable using the Boost graph library ?

From: matthieu.ferrant_at_[hidden]
Date: 2005-12-16 09:17:34

Hi,

I have a non-directed, acyclical graph with a series of end points. I need to compute the longest path between any two end points.  Right now I do this computing the longest dijkstra shortest path (using the boost graph library) from each end point and picking the longest of these, but this is quite heavy. Is there a faster way to do this ?

thanks,

matt-