Add a Floyd–Warshall algorithm example

[kylelutz]

Add an example named floyd_warshall implementing the Floyd–Warshall all-pairs shortest path algorithm on a graph represented by an adjacency-matrix storing the edge weights.

[ya1gaurav]

This example is related with Boost Compute ?

[kylelutz]

Yeah, it would be good to have an example demonstrating how to use the Boost.Compute API to implement a basic graph algorithm like all-pairs shortest paths.

[ya1gaurav]

Ok, I will work on this. I have used this algorithm in programming problems. It will be new experience with Boost Compute.

[kylelutz]

Sounds great! Thanks! Let me know if you run into any issues or have any questions.

[ya1gaurav]

Sure, it will take me some time as I am beginner to boost compute. I will see some boost compute examples to start with.