source: branches/2895_PushGP_GenealogyAnalysis/HeuristicLab.Problems.ProgramSynthesis.GenealogyAnalysis/GenealogyGraph/Interfaces/IGenealogyGraphNode.cs @ 17511

#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;
using System.Collections.Generic;
using HeuristicLab.Common;
using HeuristicLab.Core;

namespace HeuristicLab.Problems.ProgramSynthesis {
  public interface IGenealogyGraphNode : IVertex<IDeepCloneable>, IComparable<IGenealogyGraphNode> {
    double Rank { get; set; }
    double Quality { get; set; }
    bool IsElite { get; set; }
    string Id { get; }

    IEnumerable<IGenealogyGraphNode> Parents { get; }
    IEnumerable<IGenealogyGraphNode> Children { get; }
    IEnumerable<IGenealogyGraphNode> Ancestors { get; }
    IEnumerable<IGenealogyGraphNode> Descendants { get; }
    new IEnumerable<IGenealogyGraphArc> InArcs { get; }
    new IEnumerable<IGenealogyGraphArc> OutArcs { get; }
  }

  public interface IGenealogyGraphNode<T> : IGenealogyGraphNode where T : class {
    new IEnumerable<IGenealogyGraphNode<T>> Parents { get; }
    new IEnumerable<IGenealogyGraphNode<T>> Children { get; }
    new IEnumerable<IGenealogyGraphNode<T>> Ancestors { get; }
    new IEnumerable<IGenealogyGraphNode<T>> Descendants { get; }

    new T Data { get; set; }
  }
}