com_baeldung_algorithms_AntColonyOptimizationLongRunningUnitTest_java
com.baeldung.algorithms.ga.ant_colony.AntColonyOptimization
*/     public void calculateProbabilities(Ant ant) {         int i = ant.trail[currentIndex];         double pheromone = 0.0;         for (int l = 0; l < numberOfCities; l++) {             if (!ant.visited(l)) {                 pheromone += Math.pow(trails[i][l], alpha) * Math.pow(1.0 / graph[i][l], beta);             }         }         for (int j = 0; j < numberOfCities; j++) {             if (ant.visited(j)) {                 probabilities[j] = 0.0;             } else {                 double numerator = Math.pow(trails[i][j], alpha) * Math.pow(1.0 / graph[i][j], beta);                 probabilities[j] = numerator / pheromone;             }         }     }

 -> java.lang.Math.pow(double,double): double -> java.lang.Math.pow(double,double): double -> java.lang.Math.pow(double,double): double -> java.lang.Math.pow(double,double): double -> java.lang.Math.pow(double,double): double -> java.lang.Math.pow(double,double): double -> java.lang.Math.pow(double,double): double -> java.lang.Math.pow(double,double): double -> java.lang.Math.pow(double,double): double -> java.lang.Math.pow(double,double): double -> java.lang.Math.pow(double,double): double -> java.lang.Math.pow(double,double): double