Re^13: Finding All Paths From a Graph From a Given Source and End Node

[LanX]

yep just try to imagine what linearizing and short circuiting could achieve.

[BrowserUk]

try to imagine what linearizing and short circuiting could achieve.

Hm. Seeing's believing :) But I'm not really sure what you mean by "linearizing" in this context?

If you mean brute-forcing the recursion to iteration using manual stack handling, that often works out more costly than the recusion it is trying to eliminate.

If the recursion can be eliminated through tail-recursion, that's very effective in languages that support it. (Properly; goto \&recurse is usually slower).

But I'm pretty sure this can't be written to be tail-recursive.

[LanX]

just intelligent looping, no need for tail-recursion.

Any recursion can be linearized.

Pushing and popping the @path array and/or %seen is all you need as a stack.

But I'm too lazy to do neversaints homework! :)

[BrowserUk]

If I thought that this was homework, I wouldn't be doing it either!

But neversaint has a long history of posting deeply involved genomic programming tasks. And he is always more than willing to do his part in cleaning up and generalising what we post for his use.

I'm not sure whether he's making a fortune off of the help he gets here, or is on a research pittance furthering the science for the benefit of all human-kind. Nor do I much care.

He presents interesting problems, and I enjoy trying to solve them. It's far better than a cross-word or sudoku. (Besides, I wrote solvers for both of those years ago. Now if only I could get the computer to buy the papers and scan them in, they'd get used :)

Come to that. If neversaint's Perl/CS lecturer is presenting problems like these as "homework", he is either a brilliant lecturer with very gifted students; or a sadistic bastard.