I have a bundle of links in 'some' networks. I need to find out which ones are connected to each other i.e. I need to find out which links are not connected to the 'main' network.
I have been working on a flood fill recursive method, which effectively goes from link to link, finding out which ones are connected, and recursively doing the same. But the numbers are quite high, and my machine just bailed, so I wondered if there were other, better, or more efficient, ways of doing this.
Thanks in advance