Hi guys, I just posted on Jira an implementation of Burovka's algorithm (SANDBOX-348) . It's based on Connectivity algorithm for finding the list of connected component and it uses an internal list of vertices in order to reduce the call of the connectivity algorithm.
I'm available for comments and improvments :-) ciao Marco -- Marco Speranza <marco.speranz...@gmail.com> Flick photostream: http://www.flickr.com/photos/marcosperanza79/ Google Code: http://code.google.com/u/marco.speranza79/
