From: Vladimir Prus (ghost_at_[hidden])
Date: 2004-10-16 03:45:41
On Friday 15 October 2004 19:13, Doug Gregor wrote:
> I've just checked in some new graph algorithms that have been
> contributed to the BGL. They're on the branch graph_devel_1_33_0 until
> we've branched off the 1.32.0 release, at which point they will go into
> the trunk.
What's the point of the branch? If the algorithms are merged now, will that
change any existing code, possibly leading to problems?
On a related note, do you have an opinion about my dag_shortest_paths patch?
I'd like to commit the change to the trunk the next week.
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk