Floyd-Warshall algorithm to calculate the predecessor matrix and the delay between all pairs of nodes. The delay represents the distance between the two vertices and it works as the weight for the Floyd-Warshall algorithm.
Author: Rahul Simha, Weishuai Yang
Computes the shortest path between a vertex to all the other ones, for all existing vertices. This is represented by the delay between all pairs vertices.
- originalDelayMatrix – original delay matrix
the new delay matrix (dk)