Mon, 10 Dec 2012 10:41:29 +0100 wenzelm clarified transitive_closure: proper cumulation of transitive steps, which is essential for Warshall-style algorithms;
Sun, 09 Dec 2012 14:05:21 +0100 wenzelm always apply transitive_reduction_acyclic in imitation of old graph browser (essential to avoid slow layout and overcrowded display, e.g. class_deps);
Sun, 09 Dec 2012 14:01:09 +0100 wenzelm added graph operations for transitive closure and reduction in Scala -- unproven and thus better left out of the kernel-relevant ML module;
Sat, 08 Dec 2012 22:41:39 +0100 wenzelm merged
Sat, 08 Dec 2012 22:15:44 +0100 blanchet merge
Sat, 08 Dec 2012 21:54:28 +0100 blanchet don't blacklist "case" theorems -- this causes problems in MaSh later
(0) -30000 -10000 -3000 -1000 -300 -100 -30 -10 -6 +6 +10 +30 +100 +300 +1000 +3000 +10000 +30000 tip