cloudsim-plus-master/cloudsim-plus-master/cloudsim-plus/src/main/java/org/cloudbus/cloudsim/network/FloydWarshall.java
private void computeShortestPathForSpecificNumberOfHops(double[][] dk, int k) {
        for(final int i: vertices) {
            computeShortestPathFromVertexToAllVertices(dk, k, i);
        }

        updateMatrices((i,j) -> {
            dk_minus_one[i][j] = dk[i][j];
            pk_minus_one[i][j] = pk[i][j];
        });
    }
/**
     * Computes the shortest path between a vertex to all the other ones,
     * for all existing vertices, limited to a maximum number of hops.
     * 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
     */
Computes the shortest path between a vertex to all the other ones,
for all existing vertices, limited to a maximum number of hops.
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
Computes the shortest path between a vertex to all the other ones for all existing vertices limited to a maximum number of hops . 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
private void computeShortestPathForSpecificNumberOfHops(double[][] dk, int k) {
        for(final int i: vertices) {
            computeShortestPathFromVertexToAllVertices(dk, k, i);
        }
        updateMatrices((i,j) -> {
            dk_minus_one[i][j] = dk[i][j];
            pk_minus_one[i][j] = pk[i][j];
        });
    }
private void computeShortestPathForSpecificNumberOfHops ( double [ ] [ ] dk , int k ) { for ( final int i : vertices ) { computeShortestPathFromVertexToAllVertices ( dk , k , i ) ; } updateMatrices ( ( i , j ) -> { dk_minus_one [ i ] [ j ] = dk [ i ] [ j ] ; pk_minus_one [ i ] [ j ] = pk [ i ] [ j ] ; } ) ; }
Computes the shortest path between a vertex to all the other ones,
 for all existing vertices, limited to a maximum number of hops.
Computes the shortest path between a vertex to all the other ones for all existing vertices limited to a maximum number of hops .