FloydWarshall

```
public class FloydWarshall
extends java.lang.Object
```
Compilation: javac FloydWarshall.java Execution: java FloydWarshall V E Dependencies: AdjMatrixEdgeWeightedDigraph.java Floyd-Warshall all-pairs shortest path algorithm. % java FloydWarshall 100 500 Should check for negative cycles during triple loop; otherwise intermediate numbers can get exponentially large. Reference: "The Floyd-Warshall algorithm on graphs with negative cycles" by Stefan Hougardy

Constructors
Constructor and Description
`FloydWarshall(AdjMatrixEdgeWeightedDigraph G)`

Methods
Modifier and Type	Method and Description
`double`	`dist(int v, int w)`
`boolean`	`hasNegativeCycle()`
`boolean`	`hasPath(int v, int w)`
`static void`	`main(java.lang.String[] args)`
`java.lang.Iterable<DirectedEdge>`	`negativeCycle()`
`java.lang.Iterable<DirectedEdge>`	`path(int v, int w)`

Methods inherited from class java.lang.Object
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

public FloydWarshall(AdjMatrixEdgeWeightedDigraph G)

public java.lang.Iterable<DirectedEdge> negativeCycle()

public boolean hasPath(int v,
              int w)

public double dist(int v,
          int w)

public java.lang.Iterable<DirectedEdge> path(int v,
                                    int w)

public static void main(java.lang.String[] args)

Class FloydWarshall