The original implementation of WFIalgorithm() given by Floyd is as follows:
WFIalgorithm2(matrix weight) for i = 1 to |V| for j = 1 to |V| if weight[j,i]<∞ for k = 1 to |V| if weight[i,k]<∞ if (weight[j][k] > weight[j][i] + weight[i][k]) weight[j][k] = weight[j][i] + weight[i][k];
Is there any advantage to this longer implementation?
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.