cloudsim-plus-master/cloudsim-plus-master/cloudsim-plus/src/main/java/org/cloudbus/cloudsim/network/FloydWarshall.java
private double[][] computeShortestPaths() {
        final double[][] dk = new double[numVertices][numVertices];

        for(final int k: vertices) {
            computeShortestPathForSpecificNumberOfHops(dk, k);
        }

        return dk;
    }
/**
     * 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.
     *
     * @return the new delay matrix (dk)
     */
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.

@return the new delay matrix (dk)
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 . @return the new delay matrix ( dk )
private double[][] computeShortestPaths() {
        final double[][] dk = new double[numVertices][numVertices];
        for(final int k: vertices) {
            computeShortestPathForSpecificNumberOfHops(dk, k);
        }
        return dk;
    }
private double [ ] [ ] computeShortestPaths ( ) { final double [ ] [ ] dk = new double [ numVertices ] [ numVertices ] ; for ( final int k : vertices ) { computeShortestPathForSpecificNumberOfHops ( dk , k ) ; } return dk ; }
Computes the shortest path between a vertex to all the other ones,
 for all existing vertices.
Computes the shortest path between a vertex to all the other ones for all existing vertices .