User:Klever: Difference between revisions
Content added Content deleted
| Line 163: | Line 163: | ||
==[[Floyd-Warshall algorithm]]== |
==[[Floyd-Warshall algorithm]]== |
||
[[File:FloydGraph.png|thumb|250px|Graph used in this and Dijkstra's algorithm]] |
|||
The [http://en.wikipedia.org/wiki/Floyd-Warshall_algorithm Floyd algorithm or Floyd-Warshall algorithm] finds the shortest path between all pairs of nodes in a weighted, directed graph. It is an example of dynamic programming. |
The [http://en.wikipedia.org/wiki/Floyd-Warshall_algorithm Floyd algorithm or Floyd-Warshall algorithm] finds the shortest path between all pairs of nodes in a weighted, directed graph. It is an example of dynamic programming. |
||