[10827] | 1 | #region License Information
|
---|
| 2 | /* HeuristicLab
|
---|
| 3 | * Copyright (C) 2002-2014 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;
|
---|
[10459] | 23 | using System.Collections.Generic;
|
---|
| 24 | using System.Linq;
|
---|
| 25 | using HeuristicLab.Core;
|
---|
| 26 | using HeuristicLab.Encodings.SymbolicExpressionTreeEncoding;
|
---|
| 27 | using HeuristicLab.EvolutionTracking;
|
---|
| 28 |
|
---|
| 29 | namespace HeuristicLab.Problems.DataAnalysis.Symbolic {
|
---|
| 30 | public class SymbolicDataAnalysisExpressionAfterCrossoverOperator : AfterCrossoverOperator<ISymbolicExpressionTree> {
|
---|
| 31 | public override IOperation Apply() {
|
---|
[11233] | 32 | var childVertex = (IGenealogyGraphNode<ISymbolicExpressionTree>)GenealogyGraph.GetByContent(ChildParameter.ActualValue);
|
---|
[10677] | 33 | var arcs = childVertex.InArcs.ToList();
|
---|
| 34 | var nodes0 = (List<ISymbolicExpressionTreeNode>)arcs[0].Data;
|
---|
| 35 | var nodes1 = (List<ISymbolicExpressionTreeNode>)arcs[1].Data;
|
---|
[11253] | 36 | var childNodes = childVertex.Data.IterateNodesPrefix().ToList();
|
---|
[10459] | 37 | IFragment<ISymbolicExpressionTreeNode> fragment = null;
|
---|
| 38 | for (int i = 0; i < Math.Min(nodes0.Count, childNodes.Count); ++i) {
|
---|
| 39 | if (nodes0[i] == childNodes[i]) continue;
|
---|
| 40 | fragment = new Fragment<ISymbolicExpressionTreeNode> {
|
---|
| 41 | Root = childNodes[i],
|
---|
[10755] | 42 | Index1 = i,
|
---|
[10459] | 43 | };
|
---|
[10755] | 44 | fragment.Index2 = nodes1.IndexOf(fragment.Root);
|
---|
[10654] | 45 | break;
|
---|
[10459] | 46 | }
|
---|
| 47 |
|
---|
[11318] | 48 | if (fragment == null)
|
---|
| 49 | throw new InvalidOperationException("Could not identify crossover fragment.");
|
---|
| 50 |
|
---|
[10677] | 51 | arcs[0].Data = null;
|
---|
| 52 | arcs[1].Data = fragment;
|
---|
[10459] | 53 |
|
---|
| 54 | return base.Apply();
|
---|
| 55 | }
|
---|
| 56 | }
|
---|
| 57 | }
|
---|