[
https://issues.apache.org/jira/browse/SANDBOX-332?page=com.atlassian.jira.plugin.system.issuetabpanels:all-tabpanel
]
Marco Speranza updated SANDBOX-332:
-----------------------------------
Attachment: patchAddFloydWarshallImpl_modified.patch
Hi all guys,
I just modified the patch in this way:
* I modified the FloydWarshall class and I created one single static method.
* I improved a little bit also BaseGraph adding the new index Map<VertexPair,
E> and I removed old edge Set.
I'm looking forward to your suggestions and comments.
Ciao
> [graph] add FloydWarshall algorithm implementation
> ---------------------------------------------------
>
> Key: SANDBOX-332
> URL: https://issues.apache.org/jira/browse/SANDBOX-332
> Project: Commons Sandbox
> Issue Type: Improvement
> Components: Graph
> Reporter: Marco Speranza
> Priority: Minor
> Attachments: patchAddFloydWarshallImpl.patch,
> patchAddFloydWarshallImpl_modified.patch
>
>
> Hi all, I implemented the Floyd Warshall algorithm. This algorithm finds
> shortest paths between every pair of vertices.
> I based my implementation on the standard algorithm that creates a matrix NxN
> with all weights of the shortest paths.
> Futhermore I added a Map that contains all paths.
--
This message is automatically generated by JIRA.
For more information on JIRA, see: http://www.atlassian.com/software/jira
