Changeset 17544 for branches/2521_ProblemRefactoring/HeuristicLab.Problems.GraphColoring

Timestamp:

05/18/20 18:55:08 (5 years ago)

Author:

abeham

Message:

#2521: worked on refactoring, worked a lot on binary encoding / problems

File:

• branches/2521_ProblemRefactoring/HeuristicLab.Problems.GraphColoring/3.3/GraphColoringProblem.cs (modified) (4 diffs)

branches/2521_ProblemRefactoring/HeuristicLab.Problems.GraphColoring/3.3/GraphColoringProblem.cs

@@ -83 +83 @@
         imat[i, 1] = defaultInstance[i].Item2 - 1;
       }
-      Encoding.Length = defaultInstanceNodes;
+      Dimension = defaultInstanceNodes;
       AdjacencyListParameter.Value = imat;
       BestKnownQualityParameter.Value = null;
@@ -121 +121 @@
       if (FitnessFunction == FitnessFunction.Prioritized
         && BestKnownColorsParameter.Value != null
-        && Encoding.Length > 0) {
-        var mag = Math.Pow(10, -(int)Math.Ceiling(Math.Log10(Encoding.Length)));
+        && Dimension > 0) {
+        var mag = Math.Pow(10, -(int)Math.Ceiling(Math.Log10(Dimension)));
         // the value is e.g. 0.051 for 0 conflicts with 51 colors (and less than 1000 nodes)
         BestKnownQuality = BestKnownColorsParameter.Value.Value * mag;
@@ -247 +247 @@
 
     public void Load(GCPData data) {
-      Encoding.Length = data.Nodes;
+      Dimension = data.Nodes;
       AdjacencyListParameter.Value = new IntMatrix(data.Adjacencies);
       if (data.BestKnownColoring != null) {
@@ -279 +279 @@
       instance.Name = Name;
       instance.Description = Description;
-      instance.Nodes = Encoding.Length;
+      instance.Nodes = Dimension;
       var adjList = AdjacencyListParameter.Value;
       instance.Adjacencies = new int[adjList.Rows, 2];