Il giorno 30/gen/2012, alle ore 15:33, Claudio Squarcella ha scritto:
>
>
> On 30/01/2012 09:51, Marco Speranza wrote:
>> Claudio Squarcella dia.uniroma3.it> writes:
>>
>>>
>>> On 27/01/2012 12:47, Claudio Squarcella wrote:
Hello,
On 27/01/2012 12:35, Marco Speranza wrote:
>>
On 30/01/2012 09:51, Marco Speranza wrote:
Claudio Squarcella dia.uniroma3.it> writes:
On 27/01/2012 12:47, Claudio Squarcella wrote:
Hello,
On 27/01/2012 12:35, Marco Speranza wrote:
Hi all,
I'm trying to implement the Boruvka's algorithm and I need to know is a
grah is connected or n
Claudio Squarcella dia.uniroma3.it> writes:
>
>
> On 27/01/2012 12:47, Claudio Squarcella wrote:
> > Hello,
> >
> > On 27/01/2012 12:35, Marco Speranza 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'
On 27/01/2012 12:47, Claudio Squarcella wrote:
Hello,
On 27/01/2012 12:35, Marco Speranza 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 r
Hello,
On 27/01/2012 12:35, Marco Speranza 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
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
wrote:
> Hi a
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 vertic
