From: Lie-Quan Lee (llee_at_[hidden])
Date: 2002-01-10 21:49:04
On Thu, 2002-01-10 at 21:09, David Abrahams wrote:
> a. The transitive_closure page has a broken link to a
> VertexMutableGraph.html page.
I will add that into CVS ASAP. Thanks for pointing out those broken
links and document deficiencies!
> 2. Does the algorithm really depend on all the requirements of
> EdgeMutableGraph (or, for that matter, the elusive VertexMutableGraph)? For
> example, does it ever read the output graph? Does it ever remove edges?
Not all requirements. removing edges/vertices are unnecessary in this
case. trannsitive_closure implementation only construct the output by
adding vertices/edges, no other accesses to output graph.
-- Lie-Quan Lee (AKA: Rich Lee)
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk