source: branches/HeuristicLab.EvolutionTracking/HeuristicLab.Problems.DataAnalysis.Symbolic/3.4/DirectedGraph/DirectedGraph.cs @ 11232

#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 System.Drawing;
using System.Linq;
using HeuristicLab.Common;
using HeuristicLab.Core;
using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;

namespace HeuristicLab.Problems.DataAnalysis.Symbolic {
  [Item("DirectedGraph", "Generic class representing a directed graph with custom vertices and content")]
  [StorableClass]
  public class DirectedGraph : Item, IDirectedGraph {
    protected HashSet<IVertex> vertices;
    [Storable]
    public IEnumerable<IVertex> Vertices {
      get { return vertices; }
      private set { vertices = new HashSet<IVertex>(value); }
    }

    protected HashSet<IArc> arcs;
    [Storable]
    public IEnumerable<IArc> Arcs {
      get { return arcs; }
      private set { arcs = new HashSet<IArc>(value); }
    }

    [StorableConstructor]
    protected DirectedGraph(bool serializing)
      : base(serializing) {
    }

    [StorableHook(HookType.AfterDeserialization)]
    private void AfterDeserialization() {
      foreach (var vertex in vertices) {
        vertex.ArcAdded += OnArcAdded;
        vertex.ArcRemoved += OnArcRemoved;
        vertex.Changed += OnVertexChanged;
      }

      foreach (var arc in arcs) {
        var source = arc.Source;
        var target = arc.Target;
        source.AddArc(arc);
        target.AddArc(arc);
        arc.Changed += OnArcChanged;
      }
    }

    public DirectedGraph() {
      vertices = new HashSet<IVertex>();
      arcs = new HashSet<IArc>();
    }

    protected DirectedGraph(DirectedGraph original, Cloner cloner)
      : base(original, cloner) {
      vertices = new HashSet<IVertex>(original.vertices.Select(cloner.Clone));
      arcs = new HashSet<IArc>(original.arcs.Select(cloner.Clone));
    }

    public override IDeepCloneable Clone(Cloner cloner) {
      return new DirectedGraph(this, cloner);
    }

    public virtual void Clear() {
      vertices.Clear();
      arcs.Clear();
    }

    public virtual void AddVertex(IVertex vertex) {
      vertices.Add(vertex);
      // register event handlers
      vertex.Changed += OnVertexChanged;
      vertex.ArcAdded += OnArcAdded;
      vertex.ArcRemoved += OnArcRemoved;
      OnVertexAdded(this, EventArgs.Empty);
    }

    public virtual void RemoveVertex(IVertex vertex) {
      vertices.Remove(vertex);
      // remove connections to/from the removed vertex
      foreach (var arc in vertex.InArcs.Concat(vertex.OutArcs))
        RemoveArc(arc);
      // deregister event handlers
      vertex.ArcAdded -= OnArcAdded;
      vertex.ArcRemoved -= OnArcRemoved;
      vertex.Changed -= OnVertexChanged;
      OnVertexRemoved(this, EventArgs.Empty);
    }

    public IArc AddArc(IVertex source, IVertex target) {
      var arc = new Arc(source, target);
      AddArc(arc);
      return arc;
    }

    public void AddArc(IArc arc) {
      var source = (Vertex)arc.Source;
      var target = (Vertex)arc.Target;
      source.AddArc(arc);
      target.AddArc(arc);
      arcs.Add(arc);
    }

    public void RemoveArc(IArc arc) {
      arcs.Remove(arc);
      var source = (Vertex)arc.Source;
      var target = (Vertex)arc.Target;
      source.RemoveArc(arc);
      target.RemoveArc(arc);
    }

    public event EventHandler VertexAdded;
    protected virtual void OnVertexAdded(object sender, EventArgs args) {
      var added = VertexAdded;
      if (added != null)
        added(sender, args);
    }

    public event EventHandler VertexChanged;
    protected virtual void OnVertexChanged(object sender, EventArgs args) {
      var changed = VertexChanged;
      if (changed != null)
        changed(sender, args);
    }

    public event EventHandler VertexRemoved;
    protected virtual void OnVertexRemoved(object sender, EventArgs args) {
      var removed = VertexRemoved;
      if (removed != null)
        removed(sender, args);
    }

    protected virtual void OnArcAdded(object sender, EventArgs<IArc> args) {
      var arc = args.Value;
      // the ArcAdded event is fired by a vertex when an arc from or towards another vertex is added to his list of connections
      // because the arc is added in both directions by both the source and the target, this event will get fired twice 
      // here, we only want to add the arc once, so if its already contained, we return without complaining
      if (arcs.Contains(arc)) return;
      arcs.Add(arc);
      arc.Changed += OnArcChanged;
    }

    protected virtual void OnArcRemoved(object sender, EventArgs<IArc> args) {
      var arc = args.Value;
      if (!arcs.Contains(arc)) return; // the same rationale as above 
      arcs.Remove(arc);
      arc.Changed -= OnArcChanged;
    }

    protected virtual void OnArcChanged(object sender, EventArgs args) { }

    public override Image ItemImage {
      get { return Common.Resources.VSImageLibrary.Graph; }
    }
  }
}