Floyd-Warshall algorithm
English
Etymology
Named after Robert W. Floyd and Stephen Warshall.
Proper noun
- (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).
This article is issued from Wiktionary. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.