Re: [Boost-Users] Re: BGL: traversal algorithm for tree

From: Jeremy Siek (jsiek_at_[hidden])
Date: 2002-07-25 14:13:09

Hi Björn,

On Thu, 25 Jul 2002, [iso-8859-1] Björn Lindberg wrote:
yg-boo>
yg-boo> I just created a Sourceforge account, username "blindberg". What
yg-boo> is the sandbox?

It is the sourceforge CVS repository that we use for collaborating on new
(hopeful) boost libraries.

http://sourceforge.net/projects/boost-sandbox/

yg-boo>
yg-boo> I guess you're right here. Have you checked it in yet? I ask
yg-boo> because I found a "bug" in the algorithm in that it might work
yg-boo> differently from what one would expect. They it was originally
yg-boo> written, it visited edges /after/ visiting the corresponding
yg-boo> target node. This worked fine for myfrist purpose; to write out a
yg-boo> tree with edge weights. However, apart from being named on_edge,
yg-boo> which is a bit counter-intuitive, there is often a reason to want
yg-boo> to visit an edge /before/ the target node. I decided to make both
yg-boo> possible, so that a TreeGraphVisitor now has to implement both
yg-boo> on_edge (before) as well as postedge (after).

I've already checked in the code, so why don't you check it out and update
it in CVS. That way I don't get in the way :)

Cheers,
Jeremy

----------------------------------------------------------------------
 Jeremy Siek                          http://php.indiana.edu/~jsiek/
 Ph.D. Student, Indiana Univ. B'ton   email: jsiek_at_[hidden]
 C++ Booster (http://www.boost.org)   office phone: [phone]
----------------------------------------------------------------------