The DAGsTraceGraph class contains the method goralcikovaAlg(), which implements
Goralcikova and Koubek transitive closure (TC) computation over DAGs. This
algorithm is supposed to be much faster than Warshall's algorithm for general
graph TC computation. This algorithm needs to be benchmarked so that we can
switch the default from Warshall's to Goralcikova's.
Original issue reported on code.google.com by bestchai on 17 Dec 2011 at 3:53
Original issue reported on code.google.com by
bestchai
on 17 Dec 2011 at 3:53