Is it possible to have a version of Floyd's Algorithm of just O(|v|^2)?
If yes, what would it be?
Thanks.
- The Floyd's Algorithm is a common algorithm to find shortest paths in weighted graphs of O(|v|^3) -.
| CodeGuru Home | VC++ / MFC / C++ | .NET / C# | Visual Basic | VB Forums | Developer.com |
|
Results 1 to 2 of 2
Threaded View
|
Click Here to Expand Forum to Full Width |