I actually implemented an algorithm to handle infinite trees that we could use if we like.
Enjoy! On Mon, Sep 3, 2012 at 12:07 AM, Ludovic Courtès <l...@gnu.org> wrote: > Hi, > > Stefan Israelsson Tampe <stefan.ita...@gmail.com> skribis: > > > The cycle detection for a tree would probably look something like, > > Tortoise-and-hare would have to be applied to arbitrary data structures, > AIUI. > > Ludo’. > > >
cycle.scm
Description: Binary data
