#region License Information
/* HeuristicLab
* Copyright (C) 2002-2019 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
*
* This file is part of HeuristicLab.
*
* HeuristicLab is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* HeuristicLab is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with HeuristicLab. If not, see .
*/
#endregion
using System.Collections.Generic;
using HeuristicLab.Common;
using HeuristicLab.Core;
using HeuristicLab.Data;
using HEAL.Fossil;
namespace HeuristicLab.Problems.PTSP {
[Item("DistanceMatrix", "Represents a distance matrix of a Probabilistic Traveling Salesman Problem.")]
[StorableType("C1E6E275-FA8C-448F-AB49-8779EB0738BE")]
public sealed class DistanceMatrix : DoubleMatrix {
[StorableConstructor]
private DistanceMatrix(StorableConstructorFlag _) : base(_) { }
public DistanceMatrix() : base() { }
public DistanceMatrix(int rows, int columns) : base(rows, columns) { }
public DistanceMatrix(int rows, int columns, IEnumerable columnNames) : base(rows, columns, columnNames) { }
public DistanceMatrix(int rows, int columns, IEnumerable columnNames, IEnumerable rowNames) : base(rows, columns, columnNames, rowNames) { }
public DistanceMatrix(double[,] elements) : base(elements) { }
public DistanceMatrix(double[,] elements, IEnumerable columnNames) : base(elements, columnNames) { }
public DistanceMatrix(double[,] elements, IEnumerable columnNames, IEnumerable rowNames) : base(elements, columnNames, rowNames) { }
public override IDeepCloneable Clone(Cloner cloner) {
// distance matrices are not cloned for performance reasons
cloner.RegisterClonedObject(this, this);
return this;
}
}
}