[7412] | 1 | #region License Information
|
---|
| 2 | /* HeuristicLab
|
---|
| 3 | * Copyright (C) 2002-2012 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.Collections.Generic;
|
---|
| 23 | using HeuristicLab.Encodings.IntegerVectorEncoding;
|
---|
| 24 |
|
---|
| 25 | namespace HeuristicLab.Problems.GeneralizedQuadraticAssignment.Common {
|
---|
| 26 | public class IntegerVectorEqualityComparer : EqualityComparer<IntegerVector> {
|
---|
| 27 | public override bool Equals(IntegerVector x, IntegerVector y) {
|
---|
| 28 | if (x == null || y == null) return false;
|
---|
| 29 | if (x.Length != y.Length) return false;
|
---|
| 30 |
|
---|
| 31 | for (int i = 0; i < x.Length; i++)
|
---|
| 32 | if (x[i] != y[i]) return false;
|
---|
| 33 |
|
---|
| 34 | return true;
|
---|
| 35 | }
|
---|
| 36 |
|
---|
| 37 | public override int GetHashCode(IntegerVector obj) {
|
---|
| 38 | return obj.GetHashCode();
|
---|
| 39 | }
|
---|
[7432] | 40 |
|
---|
| 41 | public static double GetSimilarity(IntegerVector a, IntegerVector b) {
|
---|
| 42 | int similar = 0;
|
---|
| 43 | for (int i = 0; i < a.Length; i++) {
|
---|
| 44 | if (a[i] == b[i]) similar++;
|
---|
| 45 | }
|
---|
| 46 | return similar / (double)a.Length;
|
---|
| 47 | }
|
---|
| 48 |
|
---|
| 49 | public static double GetDistance(IntegerVector a, IntegerVector b) {
|
---|
| 50 | return 1.0 - GetSimilarity(a, b);
|
---|
| 51 | }
|
---|
| 52 |
|
---|
| 53 | public static IEnumerable<int> GetDifferingIndices(IntegerVector a, IntegerVector b) {
|
---|
| 54 | for (int i = 0; i < a.Length; i++)
|
---|
| 55 | if (a[i] != b[i]) yield return i;
|
---|
| 56 | }
|
---|
[7412] | 57 | }
|
---|
| 58 | }
|
---|