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.Collections.Generic;
|
---|
23 | using HeuristicLab.Common;
|
---|
24 |
|
---|
25 | namespace HeuristicLab.Analysis.AlgorithmBehavior.Analyzers {
|
---|
26 | public class VertexComparer : Comparer<double[]> {
|
---|
27 | public double[] d;
|
---|
28 | public double[] r;
|
---|
29 |
|
---|
30 | private double CalculateWeight(double[] x) {
|
---|
31 | double max = double.MinValue;
|
---|
32 | for (int i = 0; i < x.Length; i++) {
|
---|
33 | double w = (x[i] - d[i]) / r[i];
|
---|
34 | if (w > max) max = w;
|
---|
35 | }
|
---|
36 | return max;
|
---|
37 | }
|
---|
38 |
|
---|
39 | public override int Compare(double[] x, double[] y) {
|
---|
40 | double xw = CalculateWeight(x);
|
---|
41 | double yw = CalculateWeight(y);
|
---|
42 |
|
---|
43 | if (xw.IsAlmost(yw))
|
---|
44 | return 0;
|
---|
45 | if (xw > yw)
|
---|
46 | return 1;
|
---|
47 | return -1; /*if (xw < yw)*/
|
---|
48 | }
|
---|
49 | }
|
---|
50 | }
|
---|