5 May
2009
5 May
'09
11:35 p.m.
Jacob Holm wrote:
Depth-first traversal of a graph is most easily expressed using recursion...
The proposed "continue <functioncall>" feature doesn't help these cases, because they don't use tail calls.
And that's exactly the point -- the algorithms to which TCO *can* be applied are precisely the ones that are not typically expressed using recursion in Python. -- Greg