Return-Path: X-Original-To: apmail-commons-issues-archive@minotaur.apache.org Delivered-To: apmail-commons-issues-archive@minotaur.apache.org Received: from mail.apache.org (hermes.apache.org [140.211.11.3]) by minotaur.apache.org (Postfix) with SMTP id F2AA36C68 for ; Wed, 22 Jun 2011 09:37:10 +0000 (UTC) Received: (qmail 25008 invoked by uid 500); 22 Jun 2011 09:37:10 -0000 Delivered-To: apmail-commons-issues-archive@commons.apache.org Received: (qmail 24549 invoked by uid 500); 22 Jun 2011 09:37:09 -0000 Mailing-List: contact issues-help@commons.apache.org; run by ezmlm Precedence: bulk List-Help: List-Unsubscribe: List-Post: List-Id: Reply-To: issues@commons.apache.org Delivered-To: mailing list issues@commons.apache.org Received: (qmail 24538 invoked by uid 99); 22 Jun 2011 09:37:09 -0000 Received: from athena.apache.org (HELO athena.apache.org) (140.211.11.136) by apache.org (qpsmtpd/0.29) with ESMTP; Wed, 22 Jun 2011 09:37:09 +0000 X-ASF-Spam-Status: No, hits=-2000.0 required=5.0 tests=ALL_TRUSTED,T_RP_MATCHES_RCVD X-Spam-Check-By: apache.org Received: from [140.211.11.116] (HELO hel.zones.apache.org) (140.211.11.116) by apache.org (qpsmtpd/0.29) with ESMTP; Wed, 22 Jun 2011 09:37:08 +0000 Received: from hel.zones.apache.org (hel.zones.apache.org [140.211.11.116]) by hel.zones.apache.org (Postfix) with ESMTP id 6D48E428EF8 for ; Wed, 22 Jun 2011 09:36:47 +0000 (UTC) Date: Wed, 22 Jun 2011 09:36:47 +0000 (UTC) From: "Marco Speranza (JIRA)" To: issues@commons.apache.org Message-ID: <1002559759.27971.1308735407444.JavaMail.tomcat@hel.zones.apache.org> Subject: [jira] [Created] (SANDBOX-332) [graph] add FloydWarshall algorithm implementation MIME-Version: 1.0 Content-Type: text/plain; charset=utf-8 Content-Transfer-Encoding: 7bit X-JIRA-FingerPrint: 30527f35849b9dde25b450d4833f0394 [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