= Floyd–Warshall algorithm
{wiki=Floyd–Warshall_algorithm}
The Floyd-Warshall algorithm is a classic algorithm used in computer science and graph theory to find the shortest paths between all pairs of vertices in a weighted directed or undirected graph. It is particularly useful for graphs with positive or negative edge weights, although it cannot handle graphs with negative cycles. \#\#\# Key Features: 1. **Dynamic Programming Approach**: The algorithm uses a dynamic programming technique to iteratively improve the shortest path estimates between every pair of vertices.
Back to article page
