Beefy Boxes and Bandwidth Generously Provided by pair Networks
Welcome to the Monastery

Re: Pure regex Hamiltonian Circuit solution

by BrowserUk (Pope)
on Oct 11, 2003 at 02:26 UTC ( #298468=note: print w/replies, xml ) Need Help??

in reply to Pure regex Hamiltonian Circuit solution

++blokhead. My hat is off to you.

I'd really like to see two things.

  1. The same algorithm implemented using normal perl. Iterative, recursive, a mixture of the two. Whatever, so long as it solved the same problem (and arrived at the same answer:).
  2. A benchmark of a few, well chosen, 'typical cases' using your pure-regex, Abigail's extended regex, and the pure perl solutions.

Throw in a CPAN Perl-over-'generic paths'-C-library, solution and we'd have a very interesting shoot-out:)

Examine what is said, not who speaks.
"Efficiency is intelligent laziness." -David Dunham
"Think for yourself!" - Abigail

  • Comment on Re: Pure regex Hamiltonian Circuit solution

Log In?

What's my password?
Create A New User
Domain Nodelet?
Node Status?
node history
Node Type: note [id://298468]
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others meditating upon the Monastery: (2)
As of 2021-12-02 03:58 GMT
Find Nodes?
    Voting Booth?
    R or B?

    Results (17 votes). Check out past polls.