| 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;
|
file |
diff |
annotate
|
| Mon, 15 Aug 2011 21:54:32 +0200 |
wenzelm |
touch descendants of edited nodes;
|
file |
diff |
annotate
|
| Fri, 12 Aug 2011 20:32:25 +0200 |
wenzelm |
general Graph.schedule;
|
file |
diff |
annotate
|
| 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;
|
file |
diff |
annotate
|
| Wed, 01 Sep 2010 15:51:49 +0200 |
haftmann |
Graph.map, in analogy to Table.map
|
file |
diff |
annotate
|
| Wed, 01 Sep 2010 15:33:59 +0200 |
haftmann |
replaced Table.map' by Table.map
|
file |
diff |
annotate
|
| Tue, 20 Jul 2010 16:42:48 +0200 |
wenzelm |
export Graph.get_entry for convenience;
|
file |
diff |
annotate
|
| Fri, 26 Mar 2010 17:59:11 +0100 |
wenzelm |
low-level tuning for join/merge: ignore identical versions (SUBTLE CHANGE IN SEMANTICS);
|
file |
diff |
annotate
|
| Sat, 27 Feb 2010 22:41:22 +0100 |
wenzelm |
code simplification by inlining;
|
file |
diff |
annotate
|
| Sat, 27 Feb 2010 21:56:05 +0100 |
wenzelm |
modernized structure Int_Graph;
|
file |
diff |
annotate
|
| Sat, 06 Feb 2010 16:32:34 +0100 |
wenzelm |
removed unused "boundary" of Table/Graph.get_first;
|
file |
diff |
annotate
|
| Sun, 27 Sep 2009 21:06:43 +0200 |
wenzelm |
tuned;
|
file |
diff |
annotate
|
| 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;
|
file |
diff |
annotate
|
| Thu, 09 Jul 2009 22:01:41 +0200 |
wenzelm |
renamed functor TableFun to Table, and GraphFun to Graph;
|
file |
diff |
annotate
|
| Sat, 13 Jun 2009 19:19:14 +0200 |
wenzelm |
native get_first, with optional boundary;
|
file |
diff |
annotate
|
| Wed, 10 Jun 2009 00:46:15 +0200 |
wenzelm |
removed unused make;
|
file |
diff |
annotate
|
| Tue, 09 Jun 2009 13:56:28 +0200 |
bulwahn |
added graph builders
|
file |
diff |
annotate
|
| Thu, 05 Mar 2009 20:55:28 +0100 |
wenzelm |
removed unused TableFun().fold_map and GraphFun().fold_map_nodes;
|
file |
diff |
annotate
|
| Wed, 21 Jan 2009 23:21:44 +0100 |
wenzelm |
removed Ids;
|
file |
diff |
annotate
|
| Tue, 23 Sep 2008 15:48:55 +0200 |
wenzelm |
added del_node, which is more efficient for sparse graphs;
|
file |
diff |
annotate
|
| Thu, 11 Sep 2008 21:04:07 +0200 |
wenzelm |
added is_empty;
|
file |
diff |
annotate
|
| Tue, 09 Sep 2008 20:22:30 +0200 |
wenzelm |
export get_first from underlying table;
|
file |
diff |
annotate
|
| Wed, 05 Dec 2007 14:16:05 +0100 |
haftmann |
map_product and fold_product
|
file |
diff |
annotate
|
| Tue, 24 Jul 2007 19:44:36 +0200 |
wenzelm |
added topological_order;
|
file |
diff |
annotate
|
| Sun, 08 Jul 2007 19:51:58 +0200 |
wenzelm |
replaced exception TableFun/GraphFun.DUPS by TableFun/GraphFun.DUP;
|
file |
diff |
annotate
|
| Fri, 29 Dec 2006 17:24:46 +0100 |
wenzelm |
renamed project to subgraph, improved presentation, avoided unnecessary evaluation of predicate;
|
file |
diff |
annotate
|
| Tue, 28 Nov 2006 00:35:18 +0100 |
wenzelm |
simplified '?' operator;
|
file |
diff |
annotate
|
| Wed, 27 Sep 2006 21:13:12 +0200 |
wenzelm |
tuned all_paths;
|
file |
diff |
annotate
|
| Fri, 22 Sep 2006 14:30:37 +0200 |
berghofe |
Added function all_paths (formerly find_paths).
|
file |
diff |
annotate
|
| Tue, 27 Jun 2006 10:09:39 +0200 |
haftmann |
replaced subgraph by project
|
file |
diff |
annotate
|