| commit | d5807900e1fcb817fd0d029f52876a75f32f74b3 | |
| author | Sven Verdoolaege <skimo@kotnet.org> | |
| Wed, 17 Feb 2010 21:06:58 +0000 (17 22:06 +0100) | ||
| committer | Sven Verdoolaege <sven@nestor.cs.kuleuven.be> | |
| Thu, 18 Feb 2010 13:48:15 +0000 (18 14:48 +0100) | ||
| tree | 41d13f9ad7a6965de08c45397917559a9d770a13 | treesnapshot (tar.gz zip) |
| parent | 7d49acbe46e23d2a27a4a87195c23a944edb01b2 | commitdiff |
isl_map_transitive_closure: compute power on strongly connected components
By splitting the disjuncts of the input map into strongly connected
components, we can improve the accurateness of the result.
The computation may be more expensive, however, especially
the exactness test.
By splitting the disjuncts of the input map into strongly connected
components, we can improve the accurateness of the result.
The computation may be more expensive, however, especially
the exactness test.
| isl_test.c | diffblobblamehistory | |
| isl_transitive_closure.c | diffblobblamehistory |