الگوریتم فلوید-وارشال
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
In the Vinony graph
Within Vinony's link graph, الگوریتم فلوید-وارشال is referenced by 171 other articles, and connects out to Bellman–Ford algorithm, mathematical optimization and greedy algorithm.
It is catalogued under topics including Dynamic programming, Graph algorithms and Graph distance.
Its subject is documented across 23 Wikipedia language editions.
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
Connections
Bellman–Ford algorithm
Entity
mathematical optimization
Entity
greedy algorithm
Entity
list of algorithms
Entity
shortest path problem
Entity
convex optimization
Entity
computer science
Entity
International Standard Book Number
Entity
C
Entity
programming language
Entity
algorithm
Entity
JavaScript
Entity
Python
Entity
Java
Entity
C++
Entity
function
Entity
real number
Entity
Wayback Machine
Entity
C#
Entity
digital object identifier
Entity