src/Pure/General/graph.ML
Tue, 10 Oct 2017 13:46:12 +0200 wenzelm more operations;
Fri, 21 Feb 2014 19:20:26 +0100 haftmann simultaneous mapping of strongly connected components
Sun, 26 Jan 2014 16:23:47 +0100 haftmann obsolete
Tue, 25 Sep 2012 14:32:41 +0200 wenzelm added graph encode/decode operations;
Thu, 19 Jul 2012 15:45:59 +0200 wenzelm clarified topological ordering: preserve order of adjacency via reverse fold;
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 12:34:56 +0100 wenzelm discontinued slightly odd Graph.del_nodes (inefficient due to full Table.map);
Fri, 24 Feb 2012 20:37:52 +0100 wenzelm discontinued obsolete Graph.all_paths (last seen in 1524d69783d3 and AFP/80bbbdbfec62);
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:46:38 +0100 wenzelm removed dead code;
Thu, 23 Feb 2012 14:17:51 +0100 wenzelm directed graphs (in Scala);
Sat, 20 Aug 2011 23:35:30 +0200 wenzelm refined Graph implementation: more abstract/scalable Graph.Keys instead of plain lists -- order of adjacency is now standardized wrt. Key.ord;
Mon, 15 Aug 2011 21:54:32 +0200 wenzelm touch descendants of edited nodes;
Fri, 12 Aug 2011 20:32:25 +0200 wenzelm general Graph.schedule;
Wed, 13 Jul 2011 16:42:14 +0200 wenzelm Table.lookup_key and Graph.get_entry allow to retrieve the original key, which is not necessarily identical to the given one;
Wed, 01 Sep 2010 15:51:49 +0200 haftmann Graph.map, in analogy to Table.map
Wed, 01 Sep 2010 15:33:59 +0200 haftmann replaced Table.map' by Table.map
Tue, 20 Jul 2010 16:42:48 +0200 wenzelm export Graph.get_entry for convenience;
Fri, 26 Mar 2010 17:59:11 +0100 wenzelm low-level tuning for join/merge: ignore identical versions (SUBTLE CHANGE IN SEMANTICS);
Sat, 27 Feb 2010 22:41:22 +0100 wenzelm code simplification by inlining;
Sat, 27 Feb 2010 21:56:05 +0100 wenzelm modernized structure Int_Graph;
Sat, 06 Feb 2010 16:32:34 +0100 wenzelm removed unused "boundary" of Table/Graph.get_first;
Sun, 27 Sep 2009 21:06:43 +0200 wenzelm tuned;
Sun, 27 Sep 2009 19:39:40 +0200 wenzelm reachable: recovered reverse post-order (lost in 73ad4884441f), which is expected for all_preds/all_succs and required for topological_order;
Thu, 09 Jul 2009 22:01:41 +0200 wenzelm renamed functor TableFun to Table, and GraphFun to Graph;
Sat, 13 Jun 2009 19:19:14 +0200 wenzelm native get_first, with optional boundary;
Wed, 10 Jun 2009 00:46:15 +0200 wenzelm removed unused make;
Tue, 09 Jun 2009 13:56:28 +0200 bulwahn added graph builders
Thu, 05 Mar 2009 20:55:28 +0100 wenzelm removed unused TableFun().fold_map and GraphFun().fold_map_nodes;
Wed, 21 Jan 2009 23:21:44 +0100 wenzelm removed Ids;
Tue, 23 Sep 2008 15:48:55 +0200 wenzelm added del_node, which is more efficient for sparse graphs;
Thu, 11 Sep 2008 21:04:07 +0200 wenzelm added is_empty;
Tue, 09 Sep 2008 20:22:30 +0200 wenzelm export get_first from underlying table;
Wed, 05 Dec 2007 14:16:05 +0100 haftmann map_product and fold_product
Tue, 24 Jul 2007 19:44:36 +0200 wenzelm added topological_order;
Sun, 08 Jul 2007 19:51:58 +0200 wenzelm replaced exception TableFun/GraphFun.DUPS by TableFun/GraphFun.DUP;
Fri, 29 Dec 2006 17:24:46 +0100 wenzelm renamed project to subgraph, improved presentation, avoided unnecessary evaluation of predicate;
Tue, 28 Nov 2006 00:35:18 +0100 wenzelm simplified '?' operator;
Wed, 27 Sep 2006 21:13:12 +0200 wenzelm tuned all_paths;
Fri, 22 Sep 2006 14:30:37 +0200 berghofe Added function all_paths (formerly find_paths).
Tue, 27 Jun 2006 10:09:39 +0200 haftmann replaced subgraph by project
Thu, 11 May 2006 19:15:15 +0200 wenzelm added fold;
Fri, 05 May 2006 21:59:48 +0200 wenzelm replaced find_paths by irreducible_paths, i.e. produce paths within a Hasse diagram;
Thu, 27 Apr 2006 15:06:35 +0200 wenzelm tuned basic list operators (flat, maps, map_filter);
Tue, 11 Apr 2006 16:00:06 +0200 wenzelm tuned;
Sat, 18 Mar 2006 20:10:49 +0100 wenzelm tuned;
Sun, 12 Feb 2006 21:34:23 +0100 wenzelm share exception UNDEF with Table;
Tue, 07 Feb 2006 19:56:53 +0100 wenzelm Library.is_equal;
Fri, 03 Feb 2006 23:12:28 +0100 wenzelm canonical member/insert/merge;
Wed, 09 Nov 2005 16:26:48 +0100 wenzelm avoid code redundancy;
Wed, 09 Nov 2005 12:21:05 +0100 haftmann added join function
Fri, 28 Oct 2005 08:40:55 +0200 haftmann reachable - abandoned foldl_map in favor of fold_map
Wed, 19 Oct 2005 17:19:52 +0200 haftmann added subgraph
Wed, 05 Oct 2005 18:38:43 +0200 haftmann added fold_nodes, map_node_yield
Thu, 22 Sep 2005 07:56:16 +0200 haftmann added fold_map_graph
Thu, 15 Sep 2005 17:16:56 +0200 wenzelm TableFun/Symtab: curried lookup and update;
Thu, 01 Sep 2005 18:48:50 +0200 wenzelm curried_lookup/update;
Mon, 29 Aug 2005 08:34:24 +0200 haftmann canonical interface for 'default'
less more (0) -60 tip