http://qs321.pair.com?node_id=838919


in reply to Re: Finding all connected nodes in an all-against-all comparison
in thread Finding all connected nodes in an all-against-all comparison

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