| Fri, 21 Feb 2014 19:20:26 +0100 |
haftmann |
simultaneous mapping of strongly connected components
|
file |
diff |
annotate
|
| Sun, 26 Jan 2014 16:23:47 +0100 |
haftmann |
obsolete
|
file |
diff |
annotate
|
| Tue, 25 Sep 2012 14:32:41 +0200 |
wenzelm |
added graph encode/decode operations;
|
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
|
| 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 12:34:56 +0100 |
wenzelm |
discontinued slightly odd Graph.del_nodes (inefficient due to full Table.map);
|
file |
diff |
annotate
|
| Fri, 24 Feb 2012 20:37:52 +0100 |
wenzelm |
discontinued obsolete Graph.all_paths (last seen in 1524d69783d3 and AFP/80bbbdbfec62);
|
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:46:38 +0100 |
wenzelm |
removed dead code;
|
file |
diff |
annotate
|
| Thu, 23 Feb 2012 14:17:51 +0100 |
wenzelm |
directed graphs (in Scala);
|
file |
diff |
annotate
|
| 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
|