Ah I see a trivial example already
remotely requiring recursion
without sample data for your spontaneous example I can't test, but the following should do.
use enum qw[ CODE GRAPH START PATH SEEN ];
sub _pathsFrom {
_PATHSFROM:
{
return $_[CODE]->( @{ $_[PATH] }, $_[START] )
unless exists $_[GRAPH]->{ $_[START] };
for ( @{ $_[GRAPH]->{ $_[START] } } ) {
if ( exists $_[SEEN]->{ $_[START] . "-$_" } ) {
return $_[CODE]->( @{ $_[PATH] }, $_[START] );
} else {
@_=(
@_[ CODE, GRAPH ], $_,
[ @{ $_[PATH] }, $_[START] ],
{ %{ $_[SEEN] }, $_[START] . "-$_", undef }
);
redo _PATHSFROM;
}
}
}
}
If not, enlighten us!
UPDATE(18:16 CEST): This thread is about implementating tail call recursions, thanks for trolling with a graph-search recursion which isn't tail code.
Posts are HTML formatted. Put <p> </p> tags around your paragraphs. Put <code> </code> tags around your code and data!
Titles consisting of a single word are discouraged, and in most cases are disallowed outright.
Read Where should I post X? if you're not absolutely sure you're posting in the right place.
Please read these before you post! —
Posts may use any of the Perl Monks Approved HTML tags:
- a, abbr, b, big, blockquote, br, caption, center, col, colgroup, dd, del, details, div, dl, dt, em, font, h1, h2, h3, h4, h5, h6, hr, i, ins, li, ol, p, pre, readmore, small, span, spoiler, strike, strong, sub, summary, sup, table, tbody, td, tfoot, th, thead, tr, tt, u, ul, wbr
You may need to use entities for some characters, as follows. (Exception: Within code tags, you can put the characters literally.)
| |
For: |
|
Use: |
| & | | & |
| < | | < |
| > | | > |
| [ | | [ |
| ] | | ] |
Link using PerlMonks shortcuts! What shortcuts can I use for linking?
See Writeup Formatting Tips and other pages linked from there for more info.