From: Gregory Dai (gregory.dai_at_[hidden])
Date: 2006-11-04 13:36:52
I'm pleased to report that I've completed this project of applying
boost::graph library. I coded several wrapper classes and visitors for the
"clients" or usage contexts and was able to implement a variety of
customized applications of depth first visit and topological sort. They all
worked like a charm.
On 9/30/06, Gregory Dai <gregory.dai_at_[hidden]> wrote:
> I'm about have a chance to apply the Graph library in my work. Nothing
> fancy but a DAG is needed to ensure relationships amongst objects of a
> certain type and groups of those objects. The feature allows both objects
> and object groups to be members of another group, which may in turn be
> contained in some other groups. A group cannot have itself as a member, thus
> denying recursive containment. Nor can a contained group turn around having
> its container group as its member, etc.
> The latest stable release is 1.33, and its release notes claim
> introduction of new algorithms and improvement of existing algorithms. My
> question is whether 1.34 will have similar changes over 1.33.
-- Thanks, Greg
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk