Sciweavers

IPL
2010

The Floyd-Warshall algorithm on graphs with negative cycles

13 years 2 months ago
The Floyd-Warshall algorithm on graphs with negative cycles
The Floyd-Warshall algorithm is a simple and widely used algorithm to compute shortest paths between all pairs of vertices in an edge weighted directed graph. It can also be used to detect the presence of negative cycles. We will show that for this task many existing implementations of the Floyd-Warshall algorithm will fail because exponentially large numbers can appear during its execution.
Stefan Hougardy
Added 28 Jan 2011
Updated 28 Jan 2011
Type Journal
Year 2010
Where IPL
Authors Stefan Hougardy
Comments (0)