Floyd-Warshall Algorithm
Floyd-Warshall Algorithm
Floyd's algorithm
The Floyd-Warshall algorithm is an all-pairs shortest paths algorithm. Given a weighted graph, it computes the shortest distance between every pair of vertices. It works by iteratively considering each vertex as an intermediate node in potential shorter paths, making it suitable for dense graphs and graphs with negative edge weights (but no negative cycles).
9 connections Built by Tim Jones