jottbee
|
915cde7891
|
dfs uses the create-leaf function to insert an unresolveable adjacency
as a leaf (= new node) now. this function can be specified as an
argument to dfs.
|
2005-02-16 14:07:41 +00:00 |
|
jottbee
|
30d8807382
|
a pred function to compare a given adjacency-identifier with a given
target-identifiers can now be specified as optarg #1. auto-leafs? is
optarg #2 now.
|
2005-02-16 11:05:39 +00:00 |
|
jottbee
|
2479676e2d
|
added a comment, improved error message for unresolveable adjacencies,
a sort function is now part of this module, so it can be used standing
alone
|
2005-02-14 06:48:08 +00:00 |
|
jottbee
|
a8dd2ab60b
|
examples: a small c program to be build through makefile-c.scm
to-rule-set: rule-candidates -> dfs -> '(#{:rule} ...) -> rule-set
dfs: depth first topological sort with automatic leaf insertion
out-of-date: replaced by templates.scm
rule-trans-set: replaced by to-rule-set
|
2005-02-04 08:05:55 +00:00 |
|
jottbee
|
5b462916b1
|
dfs.scm: depth-first-search/sort algorithm, work in progress...\n to-rule-set.scm: calls dfs, work in progress...
|
2005-01-21 15:40:59 +00:00 |