Algorithms/LinearAlgebra/Distances/Minkowski.cs

using System;
using System.Linq;

namespace Algorithms.LinearAlgebra.Distances;

//github.com/ <summary>
//github.com/ Implementation of Minkowski distance.
//github.com/ It is the sum of the lengths of the projections of the line segment between the points onto the
//github.com/ coordinate axes, raised to the power of the order and then taking the p-th root.
//github.com/ For the case of order = 1, the Minkowski distance degenerates to the Manhattan distance,
//github.com/ for order = 2, the usual Euclidean distance is obtained and for order = infinity, the Chebyshev distance is obtained.
//github.com/ </summary>
public static class Minkowski
{
    //github.com/ <summary>
    //github.com/ Calculate Minkowski distance for two N-Dimensional points.
    //github.com/ </summary>
    //github.com/ <param name="point1">First N-Dimensional point.</param>
    //github.com/ <param name="point2">Second N-Dimensional point.</param>
    //github.com/ <param name="order">Order of the Minkowski distance.</param>
    //github.com/ <returns>Calculated Minkowski distance.</returns>
    public static double Distance(double[] point1, double[] point2, int order)
    {
        if (order < 1)
        {
            throw new ArgumentException("The order must be greater than or equal to 1.");
        }

        if (point1.Length != point2.Length)
        {
            throw new ArgumentException("Both points should have the same dimensionality");
        }

        // distance = (|x1-y1|^p + |x2-y2|^p + ... + |xn-yn|^p)^(1/p)
        return Math.Pow(point1.Zip(point2, (x1, x2) => Math.Pow(Math.Abs(x1 - x2), order)).Sum(), 1.0 / order);
    }
}