From: Thomas Costa (oohrah_at_[hidden])
Date: 2004-07-15 15:51:17
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?