16 Jul
2004
16 Jul
'04
2:58 a.m.
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