source: branches/HeuristicLab.EvolutionTracking/HeuristicLab.Problems.DataAnalysis.Symbolic/3.4/SymbolGraph/FPGraph.cs @ 10886

Last change on this file since 10886 was 10886, checked in by bburlacu, 8 years ago

#1772: Simplified GenealogyGraph (and related components) API in an effort to improve speed and memory consumption (eg., by sharing the same arc when walking the graph in both directions: parent-child and child-parent).

File size: 2.2 KB
Line 
1#region License Information
2/* HeuristicLab
3 * Copyright (C) 2002-2012 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
4 *
5 * This file is part of HeuristicLab.
6 *
7 * HeuristicLab is free software: you can redistribute it and/or modify
8 * it under the terms of the GNU General Public License as published by
9 * the Free Software Foundation, either version 3 of the License, or
10 * (at your option) any later version.
11 *
12 * HeuristicLab is distributed in the hope that it will be useful,
13 * but WITHOUT ANY WARRANTY; without even the implied warranty of
14 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
15 * GNU General Public License for more details.
16 *
17 * You should have received a copy of the GNU General Public License
18 * along with HeuristicLab. If not, see <http://www.gnu.org/licenses/>.
19 */
20#endregion
21
22using System.Collections.Generic;
23using System.Linq;
24using HeuristicLab.Core;
25using HeuristicLab.EvolutionTracking;
26using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
27
28namespace HeuristicLab.Problems.DataAnalysis.Symbolic {
29  [Item("Symbol graph", "A graph used to store the relationship between symbols in a population of individuals")]
30  [StorableClass]
31  public class FPGraph : DirectedGraph {
32    [Storable]
33    public Dictionary<int, List<SymbolNode>> Levels { get { return levels; } }
34    private Dictionary<int, List<SymbolNode>> levels = new Dictionary<int, List<SymbolNode>>();
35
36    public void AddNode(SymbolNode node, int level) {
37      if (levels.ContainsKey(level)) {
38        SymbolNode match = levels[level].Find(n => n.Label.Equals(node.Label));
39        if (match == null) {
40          levels[level].Add(node);
41        }
42      } else {
43        levels[level] = new List<SymbolNode> { node };
44      }
45      base.AddVertex(node);
46    }
47
48    public bool ContainsKey(string key, int level) {
49      return levels.ContainsKey(level) && levels[level].Select(n => n.Label).Contains(key);
50    }
51
52    public SymbolNode GetNode(string key, int level) {
53      SymbolNode node = null;
54      if (levels.ContainsKey(level))
55        node = levels[level].Find(n => n.Label.Equals(key));
56      return node;
57    }
58  }
59}
Note: See TracBrowser for help on using the repository browser.