CouplingGraph.all_pairs_shortest_path

CouplingGraph.all_pairs_shortest_path()[source]

Calculate all pairs shortest path matrix using Floyd-Warshall.

Returns:

D[i][j] is the length of the shortest

path from i to j.

Return type:

list[list[float]]