Floyd–Warshall algorithm

<p>In <a href="/facts/Computer_science/lN3pEyPz">computer science</a>, the Floyd–Warshall algorithm (also known as Floyd's algorithm, the Roy–Warshall algorithm, the Roy–Floyd algorithm, or the WFI algorithm) is an <a href="/facts/Algorithm/fnl5NmRt">algorithm</a> for finding <a href="/facts/Shortest_path_problem/g4nsrswr">shortest paths</a> in a directed <a href="/facts/Weighted_graph/W0MqKkyE">weighted graph</a> with positive or negative edge weights (but with no negative cycles). A single execution of the algorithm will find the lengths (summed weights) of shortest paths between all pairs of vertices. Although it does not return details of the paths themselves, it is possible to reconstruct the paths with simple modifications to the algorithm. Versions of the algorithm can also be used for finding the <a href="/facts/Transitive_closure/HEtgYGM4">transitive closure</a> of a relation 
  
    
      
        R
      
    
    {\displaystyle R}
  
, or (in connection with the <a href="/facts/Schulze_method/6N0SMAY2">Schulze voting system</a>) <a href="/facts/Widest_path_problem/f18dIR7F">widest paths</a> between all pairs of vertices in a weighted graph.
</p>

Floyd–Warshall algorithm open-in-new

Floyd–Warshall algorithm