[SANDBOX-332] [graph] add FloydWarshall algorithm implementation

• Type: Improvement
• Status: Resolved
• Priority: Minor
• Resolution: Fixed
• Component/s: Graph
• Assignee: Simone Tripodi
• Reporter: Marco Speranza
• Created: 22/Jun/11 09:34
• Updated: 24/Jun/11 10:35
• Resolved: 24/Jun/11 10:35

Description

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.