package cs437.som.distancemetrics;

import cs437.som.DistanceMetric;
import cs437.som.SOMError;

/**
 * Manhattan distance strategy.
 *
 * The Manhattan distance of 2 vectors is the sum of the absolute values of the
 * differences of the individual components of the 2 vectors.
 *
 * The exact behavior follows the formula:
 *      \text{for} \: v_1, v_2 \in \mathbb{R}^n \sum_{i=1}^{n}|v_{1_i}-v_{2_i}|
 *
 */
public class ManhattanDistanceMetric implements DistanceMetric {

    /**
     * Calculate the Manhattan distance between 2 vectors.
     *
     * @param v0 The first vector.
     * @param v1 The second vector.
     * @return The distance between v0 and v1.
     * @throws cs437.som.SOMError If the vector sizes do not match.
     */
    public double distance(double[] v0, double[] v1) throws SOMError {
        if (v0.length != v1.length) {
            throw new SOMError("ManhattanDistanceMetric: input vector lengths do not match.");
        }

        double sum = 0.0;
        for (int i = 0; i < v0.length; i++) {
            double difference = v0[i] - v1[i];
            sum += Math.abs(difference);
        }

        return sum;
    }

    @Override
    public String toString() {
        return "ManhattanDistanceMetric";
    }
}

@@ -317,16 +317,25 @@
 ormula:%0A
+ * %3Cpre%3E%0A
  *      
@@ -408,16 +408,23 @@
 2_i%7D%7C%0A *
+ %3C/pre%3E
 %0A */%0Apub

Fix doc formatting in ManhattanDistanceMetric.