Am Dienstag, den 18.07.2006, 14:52 +1000 schrieb Manfred Doudar:
Hi all:
Lately I've taken look at the available material re Boost SoC Generic Tree container, and find many parallels in what I am trying to attempt here at work (with seemingly one exception, see query below), and making good headway with a relatively robust and generic design (, though I'd hate to be reinventing the wheel).
Hello Manfred, and nice to know about other people's ongoing efforts! (I'm the SoC student in charge of trees).
However, what I could not pick out is whether or not the proposed tree can or intends to support a node owning multiple parents(?)
Well, I'm trying to keep everything as generic (and hopefully extensible) as possible, but I have to admit that I haven't given that much thought yet. As people point out in the other thread, isn't multiple parent nodes something you'd rather want a graph library (like the BGL) for? If not, I'd be glad if you could give me an idea about the cases that might be interesting for trees...
Apologies to all others for the noise, but I wasn't sure where else to post the question.
There's boostsoc2006tree@googlegroups.com, set up by my mentor, René Rivera. I'd be glad about any input and/or share... ;-) Regards, Bernhard