From: David Abrahams (david.abrahams_at_[hidden])
Date: 2002-01-10 21:09:31
a. The transitive_closure page has a broken link to a
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?
I ask because I want to build an "transitive closure estimate" which takes
up much less space than the true transitive closure but might falsely report
that a given node B is reachable from A. I think I can do this by making a
"Graph" where an edge is inserted by hashing the source and destination
vertices and setting a bit in a fixed-sized bitset.
David Abrahams, C++ library designer for hire
C++ Booster (http://www.boost.org)
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk