cloudsim-plus-master/cloudsim-plus-master/cloudsim-plus/src/main/java/org/cloudbus/cloudsim/network/FloydWarshall.java
private void computeShortestPathFromVertexToAllVertices(double[][] dk, int k, int i) {
        for(final int j: vertices) {
            pk[i][j] = -1;
            if (i != j) {
                // D_k[i][j] = min ( D_k-1[i][j], D_k-1[i][k] + D_k-1[k][j].
                if (dk_minus_one[i][j] <= dk_minus_one[i][k] + dk_minus_one[k][j]) {
                    dk[i][j] = dk_minus_one[i][j];
                    pk[i][j] = pk_minus_one[i][j];
                } else {
                    dk[i][j] = dk_minus_one[i][k] + dk_minus_one[k][j];
                    pk[i][j] = pk_minus_one[k][j];
                }
            }
        }
    }
/**
     * Computes the shortest path between only a specific vertex to all the other ones,
     * limited to a maximum number of hops, and then updating the delay matrix.
     * This is represented by the delay between all pairs vertices.
     *
     * @param dk the delay matrix to be updated
     * @param k maximum number of hops to try finding the shortest path between each vertex i and j
     * @param i the index of the vertex to compute its distance to all the other vertices
     */
Computes the shortest path between only a specific vertex to all the other ones,
limited to a maximum number of hops, and then updating the delay matrix.
This is represented by the delay between all pairs vertices.

@param dk the delay matrix to be updated
@param k maximum number of hops to try finding the shortest path between each vertex i and j
@param i the index of the vertex to compute its distance to all the other vertices
Computes the shortest path between only a specific vertex to all the other ones limited to a maximum number of hops and then updating the delay matrix . This is represented by the delay between all pairs vertices . @param dk the delay matrix to be updated @param k maximum number of hops to try finding the shortest path between each vertex i and j @param i the index of the vertex to compute its distance to all the other vertices
private void computeShortestPathFromVertexToAllVertices(double[][] dk, int k, int i) {
        for(final int j: vertices) {
            pk[i][j] = -1;
            if (i != j) {
                if (dk_minus_one[i][j] <= dk_minus_one[i][k] + dk_minus_one[k][j]) {
                    dk[i][j] = dk_minus_one[i][j];
                    pk[i][j] = pk_minus_one[i][j];
                } else {
                    dk[i][j] = dk_minus_one[i][k] + dk_minus_one[k][j];
                    pk[i][j] = pk_minus_one[k][j];
                }
            }
        }
    }
private void computeShortestPathFromVertexToAllVertices ( double [ ] [ ] dk , int k , int i ) { for ( final int j : vertices ) { pk [ i ] [ j ] = - 1 ; if ( i != j ) { if ( dk_minus_one [ i ] [ j ] <= dk_minus_one [ i ] [ k ] + dk_minus_one [ k ] [ j ] ) { dk [ i ] [ j ] = dk_minus_one [ i ] [ j ] ; pk [ i ] [ j ] = pk_minus_one [ i ] [ j ] ; } else { dk [ i ] [ j ] = dk_minus_one [ i ] [ k ] + dk_minus_one [ k ] [ j ] ; pk [ i ] [ j ] = pk_minus_one [ k ] [ j ] ; } } } }
Computes the shortest path between only a specific vertex to all the other ones,
 limited to a maximum number of hops, and then updating the delay matrix.
Computes the shortest path between only a specific vertex to all the other ones limited to a maximum number of hops and then updating the delay matrix .
// D_k[i][j] = min ( D_k-1[i][j], D_k-1[i][k] + D_k-1[k][j].