All Shortest Paths using Floyd warshall's algorithm

[Emmanuel-PLF]

Floyd's algorithm can be interesting when graph density is high (more edges than vertex).

[UnixJunkie]

how does this compares to this:
#63

[UnixJunkie]

I might give a try at this implementation and report about it.

[UnixJunkie]

Is there something needed so that this PR could be accepted?

[UnixJunkie]

Is it normal to get NegativeCycle when my graph has only edges of length 1?
adding 0 1
adding 0 5
adding 1 2
adding 2 3
adding 3 4
adding 4 5
Fatal error: exception Graph.Path.FloydWarshall(G)(W).NegativeCycle
@Emmanuel-PLF

[UnixJunkie]

My graph is undirected, has 6 nodes connected in a ring.

[UnixJunkie]

Also, there is already the Johnson algorithm in ocamlgraph.

[UnixJunkie]

@slindley