Dear all,
I have a question concerning Dijkstra and Floyd Warshall, which way is
better to get all pair shortest path, is it through using dijkstra and
looping through all the verticies and using them to find the shortest path
to any other point O(E * V + V^2 * log(V)) , or just to execute floyed
warshall on the graph O(V^3)
Thanks
Mohamed Sayed Ghoneim
--
You received this message because you are subscribed to the Google Groups
"google-codejam" group.
To post to this group, send email to [email protected].
To unsubscribe from this group, send email to
[email protected].
For more options, visit this group at
http://groups.google.com/group/google-code?hl=en.
