### Comment on

 ( #3333=superdoc: print w/ replies, xml ) Need Help??

One problem is that this:

```  for (1..min(\$bound,@nextedge)){

Isn't doing what you think. (I believe) It should be:

```  for( 1 .. min( \$bound, scalar( @nextedge ) ) ){

(That kept me guessing for an inordinate amount of time :)

Threading recursive routines is difficult. My usual process is to break the routine into two parts; one which starts threads and the other that does simple recursion within those threads. Your routine wasn't written with that in mind, so the result is that the simplest refactoring is to duplicate the subroutine like this:

```#! perl -slw
use strict;
use List::Util qw( sum min );

my \$running :shared = 0;
my \$glength :shared;

sub _path_recursive {
my( \$bound, \$len, \$path, \$end, \$tbv, \$dist ) = @_;

if( !@\$tbv ) {
\$len += \$dist->[ \$path->[-1] ][\$end];
lock \$glength;
if( \$len < \$glength ) {
\$glength = \$len;
print "\$len: @\$path \$end ",scalar(localtime);
}
return;
}

my \$last = \$dist->[ \$path->[-1] ];
my @sorted = sort { \$last->[\$a] <=> \$last->[\$b] } @\$tbv;

for( 1 .. min( \$bound, scalar( @sorted ) ) ){
my \$next = shift @sorted;
_path_recursive( \$bound, \$len + \$last->[\$next], [ @\$path, \$nex
+t ], \$end, [ @sorted ], \$dist );
push @sorted, \$next;
}
}

sub path_recursive {
my( \$bound, \$len, \$path, \$end, \$tbv, \$dist ) = @_;

if( !@\$tbv ) {
\$len += \$dist->[ \$path->[-1] ][\$end];
if( \$len < \$glength ) {
\$glength = \$len;
print "\$len: @\$path \$end ",scalar(localtime);
}
return;
}

my \$last = \$dist->[ \$path->[-1] ];
my @sorted = sort { \$last->[\$a] <=> \$last->[\$b] } @\$tbv;

for( 1 .. min( \$bound, scalar( @sorted ) ) ){
my \$next = shift @sorted;
sleep 1 while \$running > 3;
async {
{ lock \$running; ++\$running; }
print "[\$tid] started";
_path_recursive( \$bound, \$len + \$last->[\$next], [ @\$path,
+\$next ], \$end, [ @sorted ], \$dist );
{ lock \$running; --\$running; }
print "[\$tid] ended";
}->detach;
sleep 1; ## give the thread a timeslice to get going.
push @sorted, \$next;
}
sleep 1 while \$running;
}

my @dist = <DATA>;
\$_ = [ split /\s+/ ] and shift @\$_ for @dist;
\$glength = 0.5 * sum map { sum @\$_ } @dist;
path_recursive shift(), 0, [ 1 ], 24, [ 2..23 ], \@dist;

__DATA__
...

I'll try and do a better job of it after xmas.

With the rise and rise of 'Social' network sites: 'Computers are making people easier to use everyday'
Examine what is said, not who speaks -- Silence betokens consent -- Love the truth but pardon error.
"Science is about questioning the status quo. Questioning authority".
In the absence of evidence, opinion is indistinguishable from prejudice.

In reply to Re^10: Travelling problem (Anyone better 86850?) by BrowserUk
in thread Travelling problem by Dirk80

Title:
Use:  <p> text here (a paragraph) </p>
and:  <code> code here </code>
to format your post; it's "PerlMonks-approved HTML":

• 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.
• Posts may use any of the Perl Monks Approved HTML tags:
a, abbr, b, big, blockquote, br, caption, center, col, colgroup, dd, del, 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, 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?

Create A New User
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others browsing the Monastery: (9)
As of 2016-05-05 13:14 GMT
Sections?
Information?
Find Nodes?
Leftovers?
Voting Booth?
What font do you use for programming?

Results (93 votes). Check out past polls.