Or alternatively, maintain a list of visited nodes, and if already in the list, add it but do not recurse?
On Friday, November 13, 2015 at 9:42:36 AM UTC-5, Tobias Beer wrote: > > Hi Matthew, > > >> Just as a point to be aware of, if you create a cycle among the graph of >> tags or links, you cause a maximum recursion depth exceeded error. With >> tags, it's probably not a big deal, but I can easily see people creating >> cycles of tiddlers linking to one another. >> > > Perhaps maxdepth should not default to undefined, but maybe 4? > > Best wishes, > > Tobias. > -- You received this message because you are subscribed to the Google Groups "TiddlyWiki" group. To unsubscribe from this group and stop receiving emails from it, send an email to tiddlywiki+unsubscr...@googlegroups.com. To post to this group, send email to tiddlywiki@googlegroups.com. Visit this group at http://groups.google.com/group/tiddlywiki. To view this discussion on the web visit https://groups.google.com/d/msgid/tiddlywiki/b878f406-638b-4627-a419-2e525be7d4d1%40googlegroups.com. For more options, visit https://groups.google.com/d/optout.
