| Newsgroups |
gmane.lisp.allegro |
| Message-ID |
<[email protected]> |
> Hallo Friends:
> I want to define a strong connected graph with lisp:
> (let ((graph '(a (b nil . nil) c)))
> (setf (second (second graph)) (second graph))
> (setf (rest (last (second graph))) (rest (rest graph)))
> graph)
> but intepreter displays error messages
> *** - Lisp stack overflow. RESET
> Why is this graph false?
> By the way,how can I correct build a strong-connected graph with lisp
> and how can I such each atom in this graph?
>
> Best Regurd
> Xu
The PRINT function (in the top-level read-eval-print loop) gets into
infinite recursion trying to print circular list-structure. Try it again
after setting *PRINT-CIRCLE* to T.
-Bob