- Timestamp:
- 09/26/19 10:02:47 (5 years ago)
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
branches/2521_ProblemRefactoring/HeuristicLab.Problems.GraphColoring/3.3/GraphColoringProblem.cs
r17226 r17270 42 42 IProblemInstanceConsumer<GCPData>, IProblemInstanceExporter<GCPData> { 43 43 44 public override bool Maximization {45 get { return false; }46 }47 48 44 [Storable] 49 45 private IValueParameter<IntMatrix> adjacencyListParameter; … … 76 72 } 77 73 public GraphColoringProblem() { 74 Maximization = false; 78 75 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.")); 79 76 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)));
Note: See TracChangeset
for help on using the changeset viewer.