|
Boost Users : |
From: Jeremy Graham Siek (jsiek_at_[hidden])
Date: 2004-07-15 21:58:33
Hi Thomas,
Nope, there is no transitive reduction algorithm. If you write one
please consider
adding it to the BGL!
Cheers,
Jeremy
On Jul 15, 2004, at 3:51 PM, Thomas Costa wrote:
> I've been looking at the BGL headers and documentation looking for a
> templated algorithm to compute the transitive reduction of a directed
> graph and I don't see anything. Am I missing something obvious,
> showing my total lack of experience in graph theory, or is this
> algorithm not in BGL yet?
_______________________________________________
Jeremy Siek <jsiek_at_[hidden]>
http://www.osl.iu.edu/~jsiek
Ph.D. Candidate, Indiana University Bloomington
C++ Booster (http://www.boost.org)
_______________________________________________
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