#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 HeuristicLab.Common;
using HeuristicLab.Core;
using HeuristicLab.Parameters;
using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
namespace HeuristicLab.EvolutionTracking {
[StorableClass]
[Item("AfterCrossoverOperator", "Performs an action after the crossover operator is applied.")]
public class BeforeManipulatorOperator : EvolutionTrackingOperator, IManipulatorOperator where T : class,IItem {
private const string ChildParameterName = "Child";
public ILookupParameter ChildParameter {
get { return (ILookupParameter)Parameters[ChildParameterName]; }
}
protected BeforeManipulatorOperator(BeforeManipulatorOperator original, Cloner cloner)
: base(original, cloner) {
}
public override IDeepCloneable Clone(Cloner cloner) {
return new BeforeManipulatorOperator(this, cloner);
}
[StorableConstructor]
protected BeforeManipulatorOperator(bool deserializing) : base(deserializing) { }
public BeforeManipulatorOperator() {
Parameters.Add(new LookupParameter(ChildParameterName));
}
public override IOperation Apply() {
// since mutation always takes place after crossover, the vertex for the current child is already in the tree
var v = (IGenealogyGraphNode)GenealogyGraph.GetByContent(ChildParameter.ActualValue);
var clone = (T)ChildParameter.ActualValue.Clone();
var c = new GenealogyGraphNode(clone) { Rank = v.Rank - 0.5 };
GenealogyGraph.AddVertex(c);
var arcs = v.InArcs;
foreach (var arc in arcs) {
var p = arc.Source;
GenealogyGraph.RemoveArc(arc);
GenealogyGraph.AddArc(new GenealogyGraphArc(p, c));
}
GenealogyGraph.AddArc(c, v);
return base.Apply();
}
}
}