With the dijkstra algorithm,
I have to do 3 nested loops to find all shortest-paths.
What about the Floyd-Warshall Algorithm,
How does it work?
If I understand the terms correctly, if A goes to C which passes thru B
the cost of A to C is c(A,B) + c(B,C)
but when I search for some examples on the net,
they are still using 3 nested loops, so how can I work faster than the dijkstra's...
I can't take the complexity of the dijkstra's because
if I have for example 9000 nodes, it is impossible to do that
it has to finish under 2 minutes.
But I have up to 2000 nodes, it can finish within 10 minutes,
For 9000 nodes, it is going crazy....
I am not sure if this works better if I optimize the program and
how does it perform in release build.
But that's what I've got so far.
Thanks
Jack