From: David Abrahams (david.abrahams_at_[hidden])
Date: 2002-01-10 22:45:42
----- Original Message -----
From: "Lie-Quan Lee" <llee_at_[hidden]>
> > 2. Does the algorithm really depend on all the requirements of
> > EdgeMutableGraph (or, for that matter, the elusive VertexMutableGraph)?
> > 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.
It would be really valuable if you would document that and/or invent an
appropriate concept. That way, if I only need to build a representation of
the transitive closure (say, a bitset) I don't have to build the entire
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk