[13412] | 1 | #region License Information
|
---|
| 2 | /* HeuristicLab
|
---|
[16453] | 3 | * Copyright (C) 2002-2019 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
|
---|
[13412] | 4 | *
|
---|
| 5 | * This file is part of HeuristicLab.
|
---|
| 6 | *
|
---|
| 7 | * HeuristicLab is free software: you can redistribute it and/or modify
|
---|
| 8 | * it under the terms of the GNU General Public License as published by
|
---|
| 9 | * the Free Software Foundation, either version 3 of the License, or
|
---|
| 10 | * (at your option) any later version.
|
---|
| 11 | *
|
---|
| 12 | * HeuristicLab is distributed in the hope that it will be useful,
|
---|
| 13 | * but WITHOUT ANY WARRANTY; without even the implied warranty of
|
---|
| 14 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
---|
| 15 | * GNU General Public License for more details.
|
---|
| 16 | *
|
---|
| 17 | * You should have received a copy of the GNU General Public License
|
---|
| 18 | * along with HeuristicLab. If not, see <http://www.gnu.org/licenses/>.
|
---|
| 19 | */
|
---|
| 20 | #endregion
|
---|
| 21 |
|
---|
[12183] | 22 | using System.Collections.Generic;
|
---|
| 23 | using HeuristicLab.Common;
|
---|
| 24 | using HeuristicLab.Core;
|
---|
| 25 | using HeuristicLab.Data;
|
---|
[16462] | 26 | using HEAL.Fossil;
|
---|
[12183] | 27 |
|
---|
| 28 | namespace HeuristicLab.Problems.PTSP {
|
---|
[13423] | 29 | [Item("DistanceMatrix", "Represents a distance matrix of a Probabilistic Traveling Salesman Problem.")]
|
---|
[16462] | 30 | [StorableType("C1E6E275-FA8C-448F-AB49-8779EB0738BE")]
|
---|
[12183] | 31 | public sealed class DistanceMatrix : DoubleMatrix {
|
---|
| 32 | [StorableConstructor]
|
---|
[16462] | 33 | private DistanceMatrix(StorableConstructorFlag _) : base(_) { }
|
---|
[12183] | 34 | public DistanceMatrix() : base() { }
|
---|
| 35 | public DistanceMatrix(int rows, int columns) : base(rows, columns) { }
|
---|
| 36 | public DistanceMatrix(int rows, int columns, IEnumerable<string> columnNames) : base(rows, columns, columnNames) { }
|
---|
| 37 | public DistanceMatrix(int rows, int columns, IEnumerable<string> columnNames, IEnumerable<string> rowNames) : base(rows, columns, columnNames, rowNames) { }
|
---|
| 38 | public DistanceMatrix(double[,] elements) : base(elements) { }
|
---|
| 39 | public DistanceMatrix(double[,] elements, IEnumerable<string> columnNames) : base(elements, columnNames) { }
|
---|
| 40 | public DistanceMatrix(double[,] elements, IEnumerable<string> columnNames, IEnumerable<string> rowNames) : base(elements, columnNames, rowNames) { }
|
---|
| 41 |
|
---|
| 42 | public override IDeepCloneable Clone(Cloner cloner) {
|
---|
| 43 | // distance matrices are not cloned for performance reasons
|
---|
| 44 | cloner.RegisterClonedObject(this, this);
|
---|
| 45 | return this;
|
---|
| 46 | }
|
---|
| 47 | }
|
---|
| 48 | }
|
---|