Thanks to all. Am I correct in saying that with a form like:
(a . body)
if the symbol 'a' appears in 'body' the graph is cyclic,
while if the symbol does not appear in its own body the
graph is Acyclic?
--
Marco Maggi
Now feel the funk blast!
Rage Against the Machine - Calm like a bomb
Ciao,
maybe this is simple, but today I cannot find a solution;
while iterating over the nodes of a graph I can accumulate
in a list the sequence of function invocations upon each
node (pseudo-code):
(let ((result '()))
;; for each node in the iteration:
(set! result (cons (list
() Marco Maggi [EMAIL PROTECTED]
() Tue, 24 Jul 2007 16:06:31 +0200
(lambda () (for-each primitive-eval result))
Ideas?
(lambda () (primitive-eval `(begin ,@result)))
thi
___
Guile-user mailing list
Guile-user@gnu.org
() Thien-Thi Nguyen [EMAIL PROTECTED]
() Tue, 24 Jul 2007 16:37:49 +0200
() Marco Maggi [EMAIL PROTECTED]
() Tue, 24 Jul 2007 16:06:31 +0200
(lambda () (for-each primitive-eval result))
Ideas?
(lambda () (primitive-eval `(begin ,@result)))
however, this just produces
Marco Maggi wrote:
Thanks to all. Am I correct in saying that with a form like:
(a . body)
if the symbol 'a' appears in 'body' the graph is cyclic,
while if the symbol does not appear in its own body the
graph is Acyclic?
Well, it is immediately obvious that any graph (or digraph) which has
