source: branches/HeuristicLab.EvolutionTracking/HeuristicLab.Problems.DataAnalysis.Symbolic/3.4/Tracking/SymbolicDataAnalysisExpressionAfterCrossoverOperator.cs @ 11350

Last change on this file since 11350 was 11350, checked in by bburlacu, 6 years ago

#1772: Small fix to fragment tracing.

File size: 2.2 KB
Line 
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
22using System;
23using System.Collections.Generic;
24using System.Linq;
25using HeuristicLab.Core;
26using HeuristicLab.Encodings.SymbolicExpressionTreeEncoding;
27using HeuristicLab.EvolutionTracking;
28
29namespace HeuristicLab.Problems.DataAnalysis.Symbolic {
30  public class SymbolicDataAnalysisExpressionAfterCrossoverOperator : AfterCrossoverOperator<ISymbolicExpressionTree> {
31    public override IOperation Apply() {
32      var childVertex = (IGenealogyGraphNode<ISymbolicExpressionTree>)GenealogyGraph.GetByContent(ChildParameter.ActualValue);
33      var arcs = childVertex.InArcs.ToList();
34      var nodes0 = (List<ISymbolicExpressionTreeNode>)arcs[0].Data;
35      var nodes1 = (List<ISymbolicExpressionTreeNode>)arcs[1].Data;
36      var childNodes = childVertex.Data.IterateNodesPrefix().ToList();
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],
42          Index1 = i,
43        };
44        fragment.Index2 = nodes1.IndexOf(fragment.Root);
45        break;
46      }
47
48      // if the fragment is null it means that nodes0 is identical with childNodes (in other words crossover did nothing)
49      arcs[0].Data = null;
50      arcs[1].Data = fragment;
51
52      return base.Apply();
53    }
54  }
55}
Note: See TracBrowser for help on using the repository browser.