Implement Floyd-Warshall Algorithm

[Alokzh]

Description:

The repository currently lacks implementation of the Floyd-Warshall Algorithm, which is used to find the shortest paths between all pairs of vertices in a weighted graph. This algorithm is useful for handling graphs with negative weights.

Proposed Solution:

1. Add a new class AIFloydWarshall to implement the Algorithm.
2. Add proper tests for the implementation.

[Alokzh]

Hey @jordanmontt should I try this out.

Also please let me know if you have any suggestion.

[jordanmontt]

Yes, please !

[Ducasse]

Cool. This is nice to see this library getting more features.