- Timestamp:
- 07/07/20 17:46:40 (4 years ago)
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
branches/2521_ProblemRefactoring/HeuristicLab.Problems.GraphColoring/3.3/GraphColoringProblem.cs
r17544 r17655 74 74 public GraphColoringProblem() { 75 75 Maximization = false; 76 Parameters.Add(adjacencyListParameter = new ValueParameter<IntMatrix>("Adjacency List", "The adjacency list that describes the (symmetric) edges in the graph with nodes from 0 to N-1.") );76 Parameters.Add(adjacencyListParameter = new ValueParameter<IntMatrix>("Adjacency List", "The adjacency list that describes the (symmetric) edges in the graph with nodes from 0 to N-1.") { ReadOnly = true }); 77 77 Parameters.Add(fitnessFunctionParameter = new ValueParameter<EnumValue<FitnessFunction>>("Fitness Function", "The function to use for evaluating the quality of a solution.", new EnumValue<FitnessFunction>(FitnessFunction.Penalized))); 78 Parameters.Add(bestKnownColorsParameter = new OptionalValueParameter<IntValue>("BestKnownColors", "The least amount of colors in a valid coloring.") );78 Parameters.Add(bestKnownColorsParameter = new OptionalValueParameter<IntValue>("BestKnownColors", "The least amount of colors in a valid coloring.") { ReadOnly = true }); 79 79 80 80 var imat = new IntMatrix(defaultInstance.Length, 2); … … 84 84 } 85 85 Dimension = defaultInstanceNodes; 86 Encoding.LengthParameter.ReadOnly = DimensionRefParameter.ReadOnly = true; 86 87 AdjacencyListParameter.Value = imat; 87 88 BestKnownQualityParameter.Value = null;
Note: See TracChangeset
for help on using the changeset viewer.