[
https://issues.apache.org/jira/browse/SANDBOX-348?page=com.atlassian.jira.plugin.system.issuetabpanels:all-tabpanel
]
Marco Speranza updated SANDBOX-348:
-----------------------------------
Attachment: SANDBOX-348-ConnectivityAlgo.patch
Hi all, I provided a simple implementation of connectivity problem. This algo
finds the number of the connected component for an input graph.
The algo returns a collection of list of vertices, and it's possible find the
connected component for a specific set of vertices.
I am available for comments and tips :-)
ciao
Marco
> Implement the Boruvka's algorithm
> ---------------------------------
>
> Key: SANDBOX-348
> URL: https://issues.apache.org/jira/browse/SANDBOX-348
> Project: Commons Sandbox
> Issue Type: Sub-task
> Components: Graph
> Reporter: Simone Tripodi
> Assignee: Simone Tripodi
> Attachments: SANDBOX-348-ConnectivityAlgo.patch
>
>
> The class {{org.apache.commons.graph.spanning.Boruvka}} contains an empty
> implementation of
> [Boruvka|http://en.wikipedia.org/wiki/Bor%C5%AFvka'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:
https://issues.apache.org/jira/secure/ContactAdministrators!default.jspa
For more information on JIRA, see: http://www.atlassian.com/software/jira
