#region License Information
/* HeuristicLab
* Copyright (C) 2002-2014 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
*
* This file is part of HeuristicLab.
*
* HeuristicLab is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* HeuristicLab is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with HeuristicLab. If not, see .
*/
#endregion
using System.Linq;
using HeuristicLab.Core;
using HeuristicLab.Encodings.SymbolicExpressionTreeEncoding;
using HeuristicLab.EvolutionTracking;
namespace HeuristicLab.Problems.DataAnalysis.Symbolic {
public class SymbolicDataAnalysisExpressionBeforeCrossoverOperator : BeforeCrossoverOperator {
public override IOperation Apply() {
var result = base.Apply(); // the base operator will add the child to the graph before the actual crossover operation takes place
var parents = ParentsParameter.ActualValue.ToList();
var childVertex = (IGenealogyGraphNode)GenealogyGraph[parents[0]]; // use the parent since it is actually the child before crossover (and the ChildParameter doesn't have a value yet)
var arcs = childVertex.InArcs.ToList();
for (int i = 0; i < parents.Count; ++i) {
arcs[i].Data = parents[i].IterateNodesPrefix().ToList();
}
// var parentVertices = childVertex.Parents.ToList();
//
// if (parents[0].Length != parentVertices[0].Content.Length || parents[1].Length != parentVertices[1].Content.Length) {
// throw new Exception("Inconsistency detected in GenealogyGraph.");
// }
return result;
}
}
}