commons-issues mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From "Thomas Neidhart (Updated) (JIRA)" <>
Subject [jira] [Updated] (SANDBOX-348) Implement the Boruvka's algorithm
Date Sun, 05 Feb 2012 22:23:59 GMT


Thomas Neidhart updated SANDBOX-348:


Hi Simone,

I took the time and updated my attempt on Boruvka's algorithm, and you can find it in attachment
together with a quite simple performance test case.

It is based on the SuperVertex idea, and can be further improved by updating the edge list
for each SuperVertex instead of re-calculating it each time.

The files are provided as is, please take a look at it and if you find it useful, I can create
a proper patch.

> 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