UNITY (programming language): Difference between revisions

Revision as of 13:18, 13 September 2010

Revision as of 18:57, 19 January 2011

Line 44:

end

===Floyd–Warshall algorithm===

===Floyd-Warshall===

Using the [[Floyd-WarshallFloyd–Warshall algorithm|Floyd-Warshall]] all pairs [[Shortest path problem|shortest path]] algorithm, we include intermediate nodes iteratively, and get <math>\Theta(n)</math> time, using <math>\Theta(n^2)</math> processors and <math>\Theta(n^3)</math> work.

Program shortestpath