[1156] | 1 | #region License Information
|
---|
| 2 | /* HeuristicLab
|
---|
| 3 | * Copyright (C) 2002-2008 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;
|
---|
| 23 | using System.Collections.Generic;
|
---|
| 24 | using System.Linq;
|
---|
| 25 | using System.Text;
|
---|
| 26 | using HeuristicLab.Core;
|
---|
| 27 | using System.Xml;
|
---|
| 28 | using System.Diagnostics;
|
---|
| 29 | using HeuristicLab.DataAnalysis;
|
---|
| 30 | using HeuristicLab.Random;
|
---|
| 31 | using HeuristicLab.Data;
|
---|
[1856] | 32 | using HeuristicLab.Modeling;
|
---|
[1156] | 33 |
|
---|
[1245] | 34 | namespace HeuristicLab.GP.StructureIdentification.Classification {
|
---|
[1857] | 35 | public class OffspringSelectionGP : HeuristicLab.GP.StructureIdentification.OffspringSelectionGP, IClassificationAlgorithm {
|
---|
[1287] | 36 | protected override IOperator CreateProblemInjector() {
|
---|
| 37 | return new ProblemInjector();
|
---|
| 38 | }
|
---|
| 39 |
|
---|
[1245] | 40 | protected override IOperator CreateBestSolutionProcessor() {
|
---|
| 41 | IOperator seq = base.CreateBestSolutionProcessor();
|
---|
[1287] | 42 | seq.AddSubOperator(StandardGP.BestSolutionProcessor);
|
---|
[1238] | 43 | return seq;
|
---|
| 44 | }
|
---|
[1156] | 45 | }
|
---|
| 46 | }
|
---|