Bug in graph library transitive closure algorithm?
Is anyone aware of any bugs in the graph library 'transitive_closure' algorithm? 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. Thanks! Jean-Paul Watson E-mail: jwatson@sandia.gov Discrete Math Dept (9215), MS 1110 Phone: (505) 845-8887 P.O. Box 5800, Sandia National Labs FAX: (505) 845-7442 Albuquerque, NM 87185-1110 USA (Old) URL: http://www.cs.colostate.edu/~watsonj http://www.cs.colostate.edu/~watsonj
Hi All, I'll try to reply to the various messages about graph bugs within a few days... I'm currently swamped with a paper deadline. Cheers, Jeremy ---------------------------------------------------------------------- Jeremy Siek http://php.indiana.edu/~jsiek/ Ph.D. Student, Indiana Univ. B'ton email: jsiek@osl.iu.edu C++ Booster (http://www.boost.org) office phone: (812) 855-3608 ----------------------------------------------------------------------
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
participants (3)
-
Jeremy Siek -
Vladimir Prus -
Watson, Jean-paul