Apply comments from merge request

src/main/java/de/uni/bremen/grapa/library/algorithms/NativeMaximumCliqueEnnumerationSolver.java

@@ -25,8 +25,8 @@ import java.util.Scanner;
 import java.util.Set;
 
 /**
- * Calls a native VC solver on an undirected graph instance.
- * The solver is expected to be an executable binary called vc_solver in the working directory.
+ * Calls a native MCE solver on an undirected graph instance.
+ * The solver is expected to be an executable binary called mce_solver in the working directory.
  */
 public class NativeMaximumCliqueEnnumerationSolver {
 
@@ -45,7 +45,7 @@ public class NativeMaximumCliqueEnnumerationSolver {
         File solver = new File("mce_solver");
 
         if (!solver.exists()) {
-            // Use packaged vc_solver instead
+            // Use packaged mce_solver instead
             try (InputStream solverResource = (getClass().getResourceAsStream("/mce_solver"))) {
                 solver = File.createTempFile("mce_solver", "");
                 assert solverResource != null;
@@ -88,11 +88,11 @@ public class NativeMaximumCliqueEnnumerationSolver {
     }
 
     /**
-     * Reads a result from the peaty solver.
+     * Reads a result from the mce solver.
      *
      * @param graph input graph
      * @param offset an offset which needs to be substracted as the input was shifted to avoid exceptions
-     * @return a minimum vertex cover determined by peaty
+     * @return an ennumeration of maximum cliques determined by the solver
      */
     private List<Set<Vertex>> readResult(final DirectedGraph<Vertex> graph, final int offset, final Scanner scanner) {
         List<Set<Vertex>> result = new ArrayList<>();
@@ -123,7 +123,7 @@ public class NativeMaximumCliqueEnnumerationSolver {
     }
 
     /**
-     * Writes a problem for the peaty solver in its own process.
+     * Writes a problem for the mce solver in its own process.
      *
      * @param process process called
      * @param graph graph to write

src/main/java/de/uni/bremen/grapa/library/algorithms/vertexcover/NativeVcSolver.java

@@ -70,12 +70,12 @@ public class NativeVcSolver {
     }
 
     /**
-     * Reads a result from the peaty solver.
+     * Reads a result from the vc solver.
      *
      * @param graph input graph
-     * @param process process running peaty
+     * @param process process running solver
      * @param offset an offset which needs to be substracted as the input was shifted to avoid exceptions
-     * @return a minimum vertex cover determined by peaty
+     * @return a minimum vertex cover determined by the solver
      */
     private Set<Vertex> readResult(final DirectedGraph<Vertex> graph, final Process process, final int offset) {
         Set<Vertex> result = new HashSet<>();
@@ -95,7 +95,7 @@ public class NativeVcSolver {
     }
 
     /**
-     * Writes a problem for the peaty solver in its own process.
+     * Writes a problem for the vc solver in its own process.
      *
      * @param process process called
      * @param graph graph to write