Per Sedgewick's "Algorithms in C++: Part 5":
"The transitive closure of a digraph is a digraph with the same vertices but
with an edge from s to t in the transitive closure if and only if there is a
directed path from s to t in the given digraph."
This should be added to the published repository of generators and functions.
It is not presently clear whether this algorithm is better suited as a
(derived) generator or a function, although my first impression is to make it a
generator, much like the "Condensation of..." and "Complement of..." generators.
Original issue reported on code.google.com by
0x24a53...@gmail.comon 1 Jul 2011 at 2:23