弗洛伊德算法
Sign in to saveAlso known as Warshall–Floyd Algorithm
algorithm for finding all-pairs shortest paths in graphs, allowing some edge weights to be negative
Wikidata facts
- Named after
- Stephen Warshall
- Image
- Floyd-Warshall-Algorithm-Problem.png
Show 6 more facts
- different from
- Floyd Cycle Detection Algorithm
- discoverer or inventor
- Bernard Roy
- time of discovery or invention
- 1959-00-00
- Commons category
- Floyd-Warshall algorithm
- maintained by WikiProject
- WikiProject Mathematics
Sources (3)
via Wikidata · CC0
Article · 中文
Floyd-Warshall算法（英語：Floyd-Warshall algorithm），中文亦称弗洛伊德算法或佛洛依德算法，是解决任意两点间的最短路径的一种算法，可以正確處理有向圖或负权（但不可存在负权回路）的最短路径問題，同时也被用于计算有向图的传递闭包。 Floyd-Warshall算法的时间复杂度為，空间复杂度为，其中是点集。
Abstract from DBpedia / Wikipedia · CC BY-SA