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
|