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] Graph connectivity algo
Date Fri, 27 Jan 2012 11:38:24 GMT
Hi Marco!

go for it!!! Just fill an issue and provide a patch ;)

thanks for your effort,
-Simo

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



On Fri, Jan 27, 2012 at 12:35 PM, Marco Speranza
<marco.speranza79@gmail.com> wrote:
> Hi all,
>
> I'm trying to implement the Boruvka's algorithm and I need to know is a
> grah is connected or not.
> So I'd like to propose a simple algorithm to do that.
> A simple way to implement that is run a depth-first or breadth-first search
> starting from an arbitrary vertex. If the number of the vertices touched
> are the same of the origina graph, the graph is connected.
>
> Moreover the algorithm could count the number of che "connected componet" (
> http://en.wikipedia.org/wiki/Connected_component_(graph_theory).
>
> what do you think about that?
>
> Ciao
>
> --
> 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