Free cookie consent management tool by TermsFeed Policy Generator

source: branches/HeuristicLab.EvolutionaryTracking/HeuristicLab.EvolutionaryTracking/3.4/Interfaces/IGenealogyGraph.cs @ 7799

Last change on this file since 7799 was 7799, checked in by bburlacu, 11 years ago

#1772: Sanitized IGenealogyGraph interface, implemented new graph arc semantics (an arc signifies an interaction between the two nodes that it connects and has a data object containing specific information about the interaction).

File size: 1.6 KB
Line 
1#region License Information
2/* HeuristicLab
3 * Copyright (C) 2002-2010 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;
23using System.Collections.Generic;
24using HeuristicLab.Core;
25
26namespace HeuristicLab.EvolutionaryTracking {
27  public interface IGenealogyGraph<T> : INamedItem where T : class {
28    // node/vertex operations
29    bool HasNode(T t); // graph contains specific node?
30    bool Any(Func<KeyValuePair<T, GenealogyGraphNode>, bool> predicate); // graph contains any nodes matching the given predicate?
31    void Clear(); // clear graph
32    void AddNode(T t);
33    void RemoveNode(T t); // remove node if contained in the graph
34    GenealogyGraphNode GetNode(T t); // return node corresponding to object t, or null
35    // arc operation
36    void AddArc(T source, T target, object sourceData = null, object targetData = null);
37    //void AddArcs(T[] a, T b);
38  }
39}
Note: See TracBrowser for help on using the repository browser.