Revision as of 01:06, 11 October 2007 edit Fintler (talk \| contribs) Extended confirmed users 1,446 edits analysis section stub expansion ← Previous edit		Revision as of 17:20, 7 March 2008 edit undo Visame (talk \| contribs) 54 edits A new question Next edit →
Line 96: I just added: '''Therefore, the [[Computational_complexity_theory\|complexity]] of the algorithm is [[big theta\|<math>\Theta({n}^3)</math>]] and can be solved by a [[Deterministic Turing machine\|deterministic machine]] in [[polynomial time]].''' to the analysis section. Does this need any further explanation? It feels like I would be just taking stuff from other articles if I started describing it further. [[User:Fintler\|fintler]] 01:06, 11 October 2007 (UTC) ==What's the relationship between FolydWarshall and (Gauss-Jordan algorithm)== In the "Applications and generalizations" part, it says: "Inversion of real matrices (Gauss-Jordan algorithm). " is one application of Floyd-Warshall algorithm. I can't figure it out.Can anyone tell me? THANKS!E-mail me:Kankaqi [AT] gamil.com[[User:Visame\|Visame]] ([[User talk:Visame\|talk]]) 17:20, 7 March 2008 (UTC)

Talk:Floyd–Warshall algorithm: Difference between revisions