in reply to Re^3: Help required in optimizing the output (PERL)
in thread Help required in optimizing the output (PERL)

The brute force method mentioned above mentioned "for each combination of paragraphs".

You mention 600000 paragraphs.

The thought of 2^600000 iterations would definitely have me looking at the Spanning Tree solution.

  • Comment on Re^4: Help required in optimizing the output (PERL)

Replies are listed 'Best First'.
Re^5: Help required in optimizing the output (PERL)
by BrowserUk (Patriarch) on Jun 22, 2010 at 21:17 UTC
    would definitely have me looking at the Spanning Tree solution.

    Code it!

    If you succeed in creating a undirected graph to represent those 600,000 nodes and the 600,000^2 weighted edges that connect them, using any of the Graph::* modules, please inform us.

    Before you start running whichever algorithm you opt for, because, I'd be interested to know which module you choose, but as I likely have less than a century left on this world, I doubt I'll be around when it completes.

    On the other hand, a projected 1 1/2 hours brute-force attempt is worth the effort of exploring.

    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.
[reply]

In Section Seekers of Perl Wisdom