source: branches/2895_PushGP_GenealogyAnalysis/HeuristicLab.Problems.ProgramSynthesis.GenealogyAnalysis/GenealogyGraph/Interfaces/IGenealogyGraph.cs @ 16986

#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 HeuristicLab.Core;

namespace HeuristicLab.Problems.ProgramSynthesis {
  public interface IGenealogyGraph : IDirectedGraph {
    IEnumerable<IGenealogyGraphNode> GetByRank(double rank);
    IEnumerable<KeyValuePair<double, IEnumerable<IGenealogyGraphNode>>> Ranks { get; }
    IGenealogyGraphNode GetByContent(object content);
    IGenealogyGraphNode GetById(string id);
    bool Contains(object content);
    new IEnumerable<IGenealogyGraphNode> Vertices { get; }
  }

  public interface IGenealogyGraph<T> : IGenealogyGraph where T : class, IItem {
    new IEnumerable<IGenealogyGraphNode<T>> Vertices { get; }
    new IGenealogyGraphNode<T> GetByContent(object content);
    new IGenealogyGraphNode<T> GetById(string id);
  }
}