If you can't find an iterative version of the recursion in Re^11: Finding All Paths From a Graph From a Given Source and End Node better start a new thread and ask.
Cheers Rolf
In reply to Re^8: Syntactic sugar for tail call optimizations
by LanX
in thread Syntactic sugar for tail call optimizations
by LanX
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |