Floyd-Warshall algorithm
Jump to navigation
Jump to search
English[edit]
Etymology[edit]
Named after Robert W. Floyd and Stephen Warshall.
Proper noun[edit]
- (computer science, graph theory) An algorithm for finding shortest paths in a weighted graph with positive or negative edge weights (but with no negative cycles).