commons-issues mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From "Marco Speranza (JIRA)" <j...@apache.org>
Subject [jira] [Created] (SANDBOX-332) [graph] add FloydWarshall algorithm implementation
Date Wed, 22 Jun 2011 09:36:47 GMT
[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

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

        

Mime
View raw message