Floyd–Warshall algorithm
0 sources
Floyd–Warshall algorithm
Summary
Floyd–Warshall algorithm is a pathfinding algorithm[1]. It draws 13 Wikipedia views per month (pathfinding_algorithm category, ranking #4 of 5).[2]
Key Facts
- Floyd–Warshall algorithm is credited with the discovery of Bernard Roy[3].
- Floyd–Warshall algorithm's instance of is recorded as pathfinding algorithm[4].
- Floyd–Warshall algorithm's instance of is recorded as graph algorithm[5].
- Robert W. Floyd is named after Floyd–Warshall algorithm[6].
- Stephen Warshall is named after Floyd–Warshall algorithm[7].
- Floyd–Warshall algorithm's Commons category is recorded as Floyd-Warshall algorithm[8].
- Floyd–Warshall algorithm's time of discovery or invention is recorded as 1959[9].
- Floyd–Warshall algorithm's different from is recorded as Floyd Cycle Detection Algorithm[10].
- Floyd–Warshall algorithm's computes solution to is recorded as all-pairs shortest path problem[11].
- Floyd–Warshall algorithm's uses is recorded as graph data structure[12].
- Floyd–Warshall algorithm's maintained by WikiProject is recorded as WikiProject Mathematics[13].
Body
Designation and Status
Recorded instance of include pathfinding algorithm[4] and graph algorithm[5].
History and Context
Things named after include Robert W. Floyd[6], a computer scientist[14], 1936–2001[15], of United States[16], awarded the Guggenheim Fellowship[17], specialised in computer science[18] and Stephen Warshall[7], a mathematician[19], 1935–2006[20], of United States[21].
Why It Matters
Floyd–Warshall algorithm draws 13 Wikipedia views per month (pathfinding_algorithm category, ranking #4 of 5).[2] It has Wikipedia articles in 21 language editions, a strong signal of global cultural recognition.[22] It is known by 62 alternative names across languages and contexts.[23]