No such thing as a small change | |
PerlMonks |
comment on |
( [id://3333]=superdoc: 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 reply to Re^2: Finding all connected nodes in an all-against-all comparison
by LanX
|
|