Hi, I have a graph (org.geotools.graph.structure.basic.BasicGraph) and I want to find alls its subgraphs (that is, all componenents that are not connected with each other).
I think there is no such algorithm already implemented in GT and I only came up with a n^2 solution, yet. I think n log(n) should be possible. Do you know if there is an Algorithm in n log(n) which is not recursive? My graph has a max depth of ~ 200Mio so I *think* recursion matters (I might be wrong) and a simple depth-first traversal is not efficient. Cheers, Jan -- >From address is valid until 01.06.2011 ------------------------------------------------------------------------------ All of the data generated in your IT infrastructure is seriously valuable. Why? It contains a definitive record of application performance, security threats, fraudulent activity, and more. Splunk takes this data and makes sense of it. IT sense. And common sense. http://p.sf.net/sfu/splunk-d2d-c2 _______________________________________________ Geotools-gt2-users mailing list [email protected] https://lists.sourceforge.net/lists/listinfo/geotools-gt2-users
