Renamed mutation method in Mutator.

src/main/java/Interfaces/Mutator.java

@@ -5,7 +5,7 @@ import MainClasses.Candidate;
 
 public interface Mutator {
 
-    Candidate[] mutatePopulation(Candidate[] population);
+    Candidate[] generateMutatedPopulation(Candidate[] population);
 
     //TODO Remove, when decided on FRL vs NESW
     static <T extends Enum<?>> boolean isFRLEncoding(Class<T> possibleDirections) {

src/main/java/MainClasses/GeneticAlgorithm.java

@@ -130,7 +130,7 @@ public class GeneticAlgorithm {
             this.population = this.selector.selectNewPopulation(this.population, this.fitness, this.totalFitness);
 
             for (Mutator m : mutators) { // SinglePoint and Crossover at the moment
-                this.population = m.mutatePopulation(this.population);
+                this.population = m.generateMutatedPopulation(this.population);
             }
 
             System.out.println();

src/main/java/Mutators/Crossover.java

@@ -27,7 +27,7 @@ public class Crossover<T extends Enum<?>> implements Mutator {
     }
 
     @Override
-    public Candidate[] mutatePopulation(Candidate[] population) {
+    public Candidate[] generateMutatedPopulation(Candidate[] population) {
         Candidate[] mutatedPopulation = new Candidate[population.length];
         if (this.crossoverChance > crossoverMinimalChance) {
             int populationSize = population.length;

src/main/java/Mutators/SinglePoint.java

@@ -27,7 +27,7 @@ public class SinglePoint<T extends Enum<?>> implements Mutator {
     }
 
     @Override
-    public Candidate[] mutatePopulation(Candidate[] population) {
+    public Candidate[] generateMutatedPopulation(Candidate[] population) {
         Candidate[] mutatedPopulation = new Candidate[population.length];
         if (this.mutationChance > mutationMinimalChance) {