1 | #region License Information
|
---|
2 | /* HeuristicLab
|
---|
3 | * Copyright (C) 2002-2013 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
|
---|
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 |
|
---|
22 | using System;
|
---|
23 | using System.Collections.Generic;
|
---|
24 | using HeuristicLab.Common;
|
---|
25 | using HeuristicLab.Core;
|
---|
26 | using HeuristicLab.Data;
|
---|
27 | using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
|
---|
28 |
|
---|
29 | namespace HeuristicLab.Problems.TravelingSalesman {
|
---|
30 | /// <summary>
|
---|
31 | /// Represents a distance matrix of a Traveling Salesman Problem.
|
---|
32 | /// </summary>
|
---|
33 | [Item("DistanceMatrix", "Represents a distance matrix of a Traveling Salesman Problem.")]
|
---|
34 | [StorableClass]
|
---|
35 | public sealed class DistanceMatrix : DoubleMatrix {
|
---|
36 | [StorableConstructor]
|
---|
37 | private DistanceMatrix(bool deserializing) : base(deserializing) { }
|
---|
38 | private DistanceMatrix(DistanceMatrix original, Cloner cloner) {
|
---|
39 | throw new NotSupportedException("Distance matrices cannot be cloned.");
|
---|
40 | }
|
---|
41 | public DistanceMatrix() : base() { }
|
---|
42 | public DistanceMatrix(int rows, int columns) : base(rows, columns) { }
|
---|
43 | public DistanceMatrix(int rows, int columns, IEnumerable<string> columnNames) : base(rows, columns, columnNames) { }
|
---|
44 | public DistanceMatrix(int rows, int columns, IEnumerable<string> columnNames, IEnumerable<string> rowNames) : base(rows, columns, columnNames, rowNames) { }
|
---|
45 | public DistanceMatrix(double[,] elements) : base(elements) { }
|
---|
46 | public DistanceMatrix(double[,] elements, IEnumerable<string> columnNames) : base(elements, columnNames) { }
|
---|
47 | public DistanceMatrix(double[,] elements, IEnumerable<string> columnNames, IEnumerable<string> rowNames) : base(elements, columnNames, rowNames) { }
|
---|
48 |
|
---|
49 | public override IDeepCloneable Clone(Cloner cloner) {
|
---|
50 | // distance matrices are not cloned for performance reasons
|
---|
51 | cloner.RegisterClonedObject(this, this);
|
---|
52 | return this;
|
---|
53 | }
|
---|
54 | }
|
---|
55 | }
|
---|