Fix Javadoc

src/main/java/proof/exception/InvalidCoverageException.java

@@ -1,7 +1,9 @@
 package proof.exception;
 
+import proof.validator.BranchCoverageValidator;
+
 /**
- * Should only be thrown by {@link BranchConverageValidator}.
+ * Should only be thrown by {@link BranchCoverageValidator}.
  *
  * Represents an error in the variable configuration of the branching tree.
  *

src/main/java/proof/exception/InvalidGraphException.java

@@ -1,5 +1,7 @@
 package proof.exception;
 
+import proof.data.Graph;
+
 /**
  * Thrown when a constructed {@link Graph} turns out to be invalid. This might be due to ambiguous
  * edges or missing edges.

src/main/java/proof/exception/InvalidPathException.java

@@ -1,5 +1,7 @@
 package proof.exception;
 
+import proof.data.Path;
+
 /**
  * Thrown whenever a parsed Kuratowski {@link Path} turns out to be invalid.
  */

src/main/java/proof/validator/ConstraintValidator.java

@@ -37,9 +37,8 @@ public class ConstraintValidator implements ObjectValidator {
   /**
    * Creates a new constraint validator.
    *
-   * @param fixedVariables The branching variables
-   * @param numberOfSegments The maximum number of segments per edge (i.e. the optimal solution)
    * @param graph The original graph we are working on (without any crossings)
+   * @param fixedVariables The branching variables
    */
   public ConstraintValidator(Graph graph, Map<CrossingIndex, Boolean> fixedVariables) {
     this.fixedVariables = fixedVariables;