
16 Oct
2004
16 Oct
'04
8:45 a.m.
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. - Volodya