in reply to Re^7: Syntactic sugar for tail call optimizations
in thread Syntactic sugar for tail call optimizations

Thats off topic.

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

  • Comment on Re^8: Syntactic sugar for tail call optimizations

Replies are listed 'Best First'.
Re^9: Syntactic sugar for tail call optimizations
by Anonymous Monk on May 30, 2011 at 00:03 UTC
    Thats off topic.
    why?
[reply]
      The graph search in Re^11: Finding All Paths From a Graph From a Given Source and End Node is a branch and bound algorithm, i.e. it returns values which are processed by the caller.

      A Tail call is a subroutine ... that produces a return value, which is then immediately returned by the calling procedure.

      Writing the branch and bound as iteration is always possible but is IMHO not necessarily a tail call.

      (though in this case it could be possible to transform it into a tail call)

      Cheers Rolf

[reply]

In Section Seekers of Perl Wisdom