src/Pure/General/graph.scala
Thu, 02 Aug 2012 15:05:32 +0200 wenzelm tuned;
Thu, 26 Jul 2012 11:46:30 +0200 wenzelm tuned signature;
Thu, 19 Jul 2012 15:45:59 +0200 wenzelm clarified topological ordering: preserve order of adjacency via reverse fold;
Thu, 19 Jul 2012 14:15:08 +0200 wenzelm clarified signature;
Mon, 27 Feb 2012 17:13:25 +0100 wenzelm prefer final ADTs -- prevent ooddities;
Sat, 25 Feb 2012 13:17:38 +0100 wenzelm tuned comments;
Sat, 25 Feb 2012 13:13:14 +0100 wenzelm standard Graph instances;
Sat, 25 Feb 2012 13:00:32 +0100 wenzelm clarified signature -- avoid oddities of Iterable like Iterator.map;
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;
Fri, 24 Feb 2012 21:36:20 +0100 wenzelm tuned signature;
Thu, 23 Feb 2012 19:35:05 +0100 wenzelm tuned -- avoid copy of empty value;
Thu, 23 Feb 2012 16:02:07 +0100 wenzelm tuned;
Thu, 23 Feb 2012 15:49:40 +0100 wenzelm clarified Graph.restrict (formerly Graph.subgraph) based on public graph operations;
Thu, 23 Feb 2012 15:15:59 +0100 wenzelm further graph operations from ML;
Thu, 23 Feb 2012 14:17:51 +0100 wenzelm directed graphs (in Scala);
less more (0) tip