source: branches/HeuristicLab.BottomUpTreeDistance/HeuristicLab.Problems.DataAnalysis.Symbolic/3.4/DirectedGraph/Interfaces/IDirectedGraph.cs @ 11238

#region License Information
/* HeuristicLab
 * Copyright (C) 2002-2010 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.Core;

namespace HeuristicLab.Problems.DataAnalysis.Symbolic {
  public interface IDirectedGraph : IItem {
    void Clear();
    void AddVertex(IVertex vertex);
    IArc AddArc(IVertex source, IVertex target);
    void AddArc(IArc arc);
    void RemoveVertex(IVertex vertex);
    void RemoveArc(IArc arc);
    IEnumerable<IVertex> Vertices { get; }
    IEnumerable<IArc> Arcs { get; }

    event EventHandler VertexAdded;
    event EventHandler VertexRemoved;
    event EventHandler ArcAdded;
    event EventHandler ArcRemoved;
  }
}