Problem on a Floyd-Warshall implementation using c++
- by Henrique
I've got a assignment for my college, already implemented Dijkstra and Bellman-Ford sucessfully, but i'm on trouble on this one.
Everything looks fine, but it's not giving me the correct answer.
Here's the code:
void FloydWarshall()
{
//Also assume that n is the number of vertices and edgeCost(i,i) = 0
int path[500][500];
/* A…