| Mon, 25 Jun 2018 17:18:55 +0200 |
wenzelm |
more scalable output;
|
file |
diff |
annotate
|
| Tue, 29 May 2018 20:00:10 +0200 |
wenzelm |
tuned signature;
|
file |
diff |
annotate
|
| Fri, 23 Mar 2018 21:56:22 +0100 |
wenzelm |
clarified signature;
|
file |
diff |
annotate
|
| Tue, 07 Nov 2017 11:11:37 +0100 |
wenzelm |
backed out odd "bug fix" 671decd2e627;
|
file |
diff |
annotate
|
| Sun, 05 Nov 2017 16:57:03 +0100 |
wenzelm |
uniform graph restriction: build_graph is more sparse than imports_graph and may yield different results for exclude_session_groups / exclude_sessions (e.g. "isabelle build -a -X main");
|
file |
diff |
annotate
|
| Tue, 10 Oct 2017 13:46:12 +0200 |
wenzelm |
more operations;
|
file |
diff |
annotate
|
| Mon, 24 Oct 2016 12:16:12 +0200 |
wenzelm |
discontinued unused / untested distinction of separate PIDE modules;
|
file |
diff |
annotate
|
| Sun, 03 May 2015 00:01:10 +0200 |
wenzelm |
misc tuning, based on warnings by IntelliJ IDEA;
|
file |
diff |
annotate
|
| Sun, 04 Jan 2015 14:05:24 +0100 |
wenzelm |
clarified static full_graph vs. dynamic visible_graph;
|
file |
diff |
annotate
|
| Sat, 03 Jan 2015 20:22:27 +0100 |
wenzelm |
more formal Graph_Display.Node (with ordering) and Graph_Display.Edge;
|
file |
diff |
annotate
|
| Wed, 31 Dec 2014 21:45:30 +0100 |
wenzelm |
converse graph according to Graph_Display;
|
file |
diff |
annotate
|
| Wed, 02 Apr 2014 20:22:12 +0200 |
wenzelm |
more explicit iterator terminology, in accordance to Scala 2.8 library;
|
file |
diff |
annotate
|
| Mon, 10 Dec 2012 15:17:47 +0100 |
wenzelm |
stateless dockable window for graphview, which is triggered by the active area of the corresponding diagnostic command;
|
file |
diff |
annotate
|
| Mon, 10 Dec 2012 10:41:29 +0100 |
wenzelm |
clarified transitive_closure: proper cumulation of transitive steps, which is essential for Warshall-style algorithms;
|
file |
diff |
annotate
|
| 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;
|
file |
diff |
annotate
|
| Tue, 25 Sep 2012 14:32:41 +0200 |
wenzelm |
added graph encode/decode operations;
|
file |
diff |
annotate
|
| Thu, 02 Aug 2012 15:05:32 +0200 |
wenzelm |
tuned;
|
file |
diff |
annotate
|
| Thu, 26 Jul 2012 11:46:30 +0200 |
wenzelm |
tuned signature;
|
file |
diff |
annotate
|
| Thu, 19 Jul 2012 15:45:59 +0200 |
wenzelm |
clarified topological ordering: preserve order of adjacency via reverse fold;
|
file |
diff |
annotate
|
| Thu, 19 Jul 2012 14:15:08 +0200 |
wenzelm |
clarified signature;
|
file |
diff |
annotate
|
| Mon, 27 Feb 2012 17:13:25 +0100 |
wenzelm |
prefer final ADTs -- prevent ooddities;
|
file |
diff |
annotate
|
| Sat, 25 Feb 2012 13:17:38 +0100 |
wenzelm |
tuned comments;
|
file |
diff |
annotate
|
| Sat, 25 Feb 2012 13:13:14 +0100 |
wenzelm |
standard Graph instances;
|
file |
diff |
annotate
|
| Sat, 25 Feb 2012 13:00:32 +0100 |
wenzelm |
clarified signature -- avoid oddities of Iterable like Iterator.map;
|
file |
diff |
annotate
|
| Fri, 24 Feb 2012 22:58:13 +0100 |
wenzelm |
prefer sorted Map/Set for canonical order of results -- pass ordering via fresh copy of empty;
|
file |
diff |
annotate
|
| Fri, 24 Feb 2012 21:36:20 +0100 |
wenzelm |
tuned signature;
|
file |
diff |
annotate
|
| Thu, 23 Feb 2012 19:35:05 +0100 |
wenzelm |
tuned -- avoid copy of empty value;
|
file |
diff |
annotate
|
| Thu, 23 Feb 2012 16:02:07 +0100 |
wenzelm |
tuned;
|
file |
diff |
annotate
|
| Thu, 23 Feb 2012 15:49:40 +0100 |
wenzelm |
clarified Graph.restrict (formerly Graph.subgraph) based on public graph operations;
|
file |
diff |
annotate
|
| Thu, 23 Feb 2012 15:15:59 +0100 |
wenzelm |
further graph operations from ML;
|
file |
diff |
annotate
|
| Thu, 23 Feb 2012 14:17:51 +0100 |
wenzelm |
directed graphs (in Scala);
|
file |
diff |
annotate
|