commons-issues mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From "Simone Tripodi (Commented) (JIRA)" <>
Subject [jira] [Commented] (SANDBOX-348) Implement the Boruvka's algorithm
Date Tue, 31 Jan 2012 20:48:11 GMT


Simone Tripodi commented on SANDBOX-348:

Hi Thomas,
welcome in the graph brotherhood!!! ;)

Indeed, Boruvka is the less performant algorithm for the MST search, the reason to keep it
is that commons-graph aims to be a graph-pedia reference implementation, so users are free
to use the algorithm they prefer - I cannot immagine why they would prefer Boruvka instead
of Kruskal, but maybe there are conditions under which it could work.

That means that, if you are interested on graph/have any proposal, please feel free to fill
an issue and provide an impl! Have a look also to current open issues/task and, if you are
using eclipse, there are some type inference errors detected that need to be fixed ;)

As a side note: do you mind sharing the benchmarks you wrote on MST algos?

Many thanks in advance,
> Implement the Boruvka's algorithm
> ---------------------------------
>                 Key: SANDBOX-348
>                 URL:
>             Project: Commons Sandbox
>          Issue Type: Sub-task
>          Components: Graph
>            Reporter: Simone Tripodi
>            Assignee: Simone Tripodi
>         Attachments: SANDBOX-348-ConnectivityAlgo.patch, SANDBOX-348_Boruvka_algorithm_implementation.patch
> The class {{org.apache.commons.graph.spanning.Boruvka}} contains an empty implementation
of [Boruvka|'s_algorithm]'s algorithm, that needs
to be filled.

This message is automatically generated by JIRA.
If you think it was sent incorrectly, please contact your JIRA administrators:!default.jspa
For more information on JIRA, see:


View raw message