src/Pure/General/graph.ML
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'
Thu, 25 Aug 2005 09:23:13 +0200 haftmann added 'default' function
Tue, 19 Jul 2005 20:47:01 +0200 wenzelm Inttab.defined;
Wed, 13 Jul 2005 16:07:32 +0200 wenzelm Graph: fast_string_ord;
Fri, 17 Jun 2005 18:33:30 +0200 wenzelm Table.fold;
Wed, 18 May 2005 11:31:00 +0200 wenzelm removed update_node, which is just an instance of map_node;
Thu, 05 May 2005 11:56:00 +0200 dixon lucas - added update node function.
Sun, 17 Apr 2005 19:39:11 +0200 wenzelm tuned;
Thu, 03 Mar 2005 12:43:01 +0100 skalberg Move towards standard functions.
Sun, 13 Feb 2005 17:15:14 +0100 skalberg Deleted Library.option type.
Tue, 24 Aug 2004 17:55:24 +0200 obua changes
Mon, 21 Jun 2004 10:25:57 +0200 kleing Merged in license change from Isabelle2004
Fri, 21 May 2004 21:28:01 +0200 wenzelm added dest, minimals, maximals, is_edge, add_edge/merge_trans_acyclic;
Thu, 21 Aug 2003 16:18:43 +0200 berghofe Added function strong_conn for computing the strongly connected components
Mon, 10 Dec 2001 15:37:03 +0100 berghofe Fixed bug in function find_paths.
Fri, 14 Jul 2000 17:49:56 +0200 wenzelm improved add_edges_cyclic;
Thu, 13 Jul 2000 23:16:48 +0200 wenzelm tuned exceptions;
Fri, 05 May 2000 22:02:46 +0200 wenzelm GPLed;
Mon, 17 May 1999 21:31:08 +0200 wenzelm removed get_nodes;
Mon, 25 Jan 1999 20:35:19 +0100 wenzelm tuned;
Tue, 19 Jan 1999 11:46:18 +0100 wenzelm tuned;
Mon, 18 Jan 1999 21:08:27 +0100 wenzelm added General/graph.ML: generic direct graphs;
less more (0) tip