source: branches/HeuristicLab.EvolutionTracking/HeuristicLab.EvolutionTracking/3.4/GenealogyGraph/GenealogyGraphNode.cs @ 10685

#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 <http://www.gnu.org/licenses/>.
 */
#endregion

using System.Collections.Generic;
using System.Linq;
using HeuristicLab.Common;
using HeuristicLab.Core;
using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;

namespace HeuristicLab.EvolutionTracking {
  [StorableClass]
  [Item("GenealogGraphNode", "A class representing a node in the GenealogyGraph")]
  public class GenealogyGraphNode : Vertex, IGenealogyGraphNode {
    [StorableConstructor]
    protected GenealogyGraphNode(bool deserializing) : base(deserializing) { }
    public override IDeepCloneable Clone(Cloner cloner) {
      return new GenealogyGraphNode(this, cloner);
    }
    protected GenealogyGraphNode(GenealogyGraphNode original, Cloner cloner)
      : base(original, cloner) {
    }

    public GenealogyGraphNode() { }

    public new IEnumerable<IGenealogyGraphArc> InArcs {
      get { return base.InArcs.Cast<IGenealogyGraphArc>().ToList(); }
      set { base.InArcs = value; }
    }
    public new IEnumerable<IGenealogyGraphArc> OutArcs {
      get { return base.OutArcs.Cast<IGenealogyGraphArc>().ToList(); }
      set { base.InArcs = value; }
    }
    public IEnumerable<IGenealogyGraphNode> Ancestors {
      get {
        // for performance, we use a hashset for lookup and a list for iteration
        var nodes = new HashSet<IGenealogyGraphNode> { this };
        var list = new List<IGenealogyGraphNode> { this };
        int i = 0;
        while (i != list.Count) {
          foreach (var e in list[i].InArcs) {
            if (nodes.Contains(e.Source)) continue;
            nodes.Add(e.Source);
            list.Add(e.Source);
          }
          ++i;
        }
        return list;
      }
    }
    /// <summary>
    /// Performs a downward-breath-traversal of the genealogy graph using the nodes OutArcs
    /// </summary>
    /// <returns>All the descendants of the current node</returns>
    public IEnumerable<IGenealogyGraphNode> Descendants {
      get {
        var nodes = new HashSet<IGenealogyGraphNode> { this };
        var list = new List<IGenealogyGraphNode> { this };
        int i = 0;
        while (i != list.Count) {
          foreach (var e in list[i].OutArcs) {
            if (nodes.Contains(e.Target)) continue;
            nodes.Add(e.Target);
            list.Add(e.Target);
          }
          ++i;
        }
        return list;
      }
    }
    [Storable]
    private double rank;
    public double Rank {
      get { return rank; }
      set { rank = value; }
    }
    [Storable]
    private double quality;
    public double Quality {
      get { return quality; }
      set { quality = value; }
    }
    [Storable]
    private bool isElite;
    public bool IsElite {
      get { return isElite; }
      set { isElite = value; }
    }
    public int CompareTo(IGenealogyGraphNode other) {
      return Quality.CompareTo(other.Quality);
    }
    public new void AddForwardArc(IVertex target, double w = 0.0, object data = null) {
      var arc = new GenealogyGraphArc { Source = this, Target = (IGenealogyGraphNode)target, Data = data, Weight = w };
      base.AddForwardArc(arc);
    }
    public new void AddReverseArc(IVertex source, double w = 0.0, object data = null) {
      var arc = new GenealogyGraphArc { Source = (IGenealogyGraphNode)source, Target = this, Data = data, Weight = w };
      base.AddReverseArc(arc);
    }
    public IEnumerable<IGenealogyGraphNode> Parents {
      get { return InArcs.Select(a => a.Source); }
    }
    public IEnumerable<IGenealogyGraphNode> Children {
      get { return OutArcs.Select(a => a.Target); }
    }
  }

  [StorableClass]
  [Item("GenealogyGraphNode", "A genealogy graph node which also has a Content")]
  public class GenealogyGraphNode<T> : GenealogyGraphNode, IGenealogyGraphNode<T> where T : class, IItem {
    public new T Content {
      get { return (T)base.Content; }
      set { base.Content = value; }
    }
    public GenealogyGraphNode() { }
    protected GenealogyGraphNode(GenealogyGraphNode<T> original, Cloner cloner)
      : base(original, cloner) {
      Content = original.Content;
    }
    public override IDeepCloneable Clone(Cloner cloner) {
      return new GenealogyGraphNode<T>(this, cloner);
    }
    public new IEnumerable<IGenealogyGraphNode<T>> Parents {
      get { return base.Parents.Select(p => (IGenealogyGraphNode<T>)p); }
    }
    public new IEnumerable<IGenealogyGraphNode<T>> Children {
      get { return base.Children.Select(c => (IGenealogyGraphNode<T>)c); }
    }
    public new IEnumerable<IGenealogyGraphNode<T>> Ancestors {
      get { return base.Ancestors.Select(x => (IGenealogyGraphNode<T>)x); }
    }
    public new IEnumerable<IGenealogyGraphNode<T>> Descendants {
      get { return base.Descendants.Select(x => (IGenealogyGraphNode<T>)x); }
    }
  }
}