commons-dev mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From Simone Tripodi <simonetrip...@apache.org>
Subject Re: [Graph] Burovka's algorithm implementation
Date Tue, 31 Jan 2012 16:52:16 GMT
Ciao Marco,

thanks for the reminder, I just applied the patch, see r1238692[1].
Please, for future patch, don't reformat the whole code ;)

Thanks for contributing!
-Simo

[1] http://svn.apache.org/viewvc?rev=1238692&view=rev

http://people.apache.org/~simonetripodi/
http://simonetripodi.livejournal.com/
http://twitter.com/simonetripodi
http://www.99soft.org/



On Tue, Jan 31, 2012 at 5:23 PM, Marco Speranza
<marco.speranza79@gmail.com> wrote:
> 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.speranza79@gmail.com>
>
> Flick photostream: http://www.flickr.com/photos/marcosperanza79/
> Google Code: http://code.google.com/u/marco.speranza79/

---------------------------------------------------------------------
To unsubscribe, e-mail: dev-unsubscribe@commons.apache.org
For additional commands, e-mail: dev-help@commons.apache.org


Mime
View raw message