in reply to Re^4: Help required in optimizing the output (PERL)
in thread Help required in optimizing the output (PERL)
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.
|
|---|