the Floyd–Warshall algorithm (also known as Floyd's algorithm, Roy–Warshall algorithm, Roy–Floyd algorithm, or the WFI algorithm) is a graph analysis .algorithm for finding shortest paths in a weighted graph with positive or negative edge weights (but with no negative cycles)