|
Boost Users : |
From: Vladimir Prus (ghost_at_[hidden])
Date: 2003-10-20 00:06:18
Watson, Jean-paul wrote:
> Is anyone aware of any bugs in the graph library 'transitive_closure'
> algorithm?
No, when I finished it I though it was correct.
> I believe I have a concrete example that exhibits an obvious
> bug (in particular, missing vertices that are reachable from certain
> source vertices), but (1) wasn't sure if there was a work-around or some
> well-known avoidance tactic and (2) whether anyone was actively supporting
> the graph library components.
If you have a test case, could you just send it, mentioning which results
you get and what you expected?
- Volodya
Boost-users list run by williamkempf at hotmail.com, kalb at libertysoft.com, bjorn.karlsson at readsoft.com, gregod at cs.rpi.edu, wekempf at cox.net