What is the Advantages and disadvantages of Floyd warshall algorithm?

The Floyd-Warshall algorithm efficiently computes the shortest paths between all pairs of vertices in a weighted graph, making it particularly useful for dense graphs and scenariOS where multiple queries for shortest paths are needed. Its advantages include its simplicity, ease of implementation, and capability to handle negative weights (as long as there are no negative cycles). However, its main disadvantage is its time complexity of (O(V^3)), which can be prohibitive for large graphs, and it requires (O(V^2)) space, limiting its practicality for very large datasets.