|
|
|
| Pathologically Eclectic Rubbish Lister | |
| PerlMonks |
Re^2: Finding all connected nodes in an all-against-all comparisonby LanX (Saint) |
| on May 07, 2010 at 14:15 UTC ( [id://838919]=note: print w/replies, xml ) | Need Help?? |
|
UPDATE: ARGH sorry this reply was meant for the OP! Thats really not trivial and more complicated than I thought because of edge cases (not covered in your sample code) So I can fully recommend using an already tested and optimized graph module because all solutions I had so far need to be rewritten for performance reasons...
Cheers Rolf
In Section
Seekers of Perl Wisdom
|
|
||||||||||||||||||||||