From: Kasper Peeters (peekas_at_[hidden])
Date: 2002-10-10 09:57:14
> Trees are a special case of graphs.
While true in theory, this may not help you too much in practise. The
linear STL containers are also special cases of graphs, mathematically
speaking, yet the fact that the concept of a vector is much much
simpler than that of a graph is a good reason to 'duplicate' this
> What advantages does this library have over Boost.Graph?
So in short: the tree library is much simpler than the graph library,
both in implementation and (most importantly) in usage. The tree
concept is a lot simpler to understand for most people than the graph
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk