Free cookie consent management tool by TermsFeed Policy Generator

source: branches/2864_PermutationProblems/HeuristicLab.Problems.Instances/3.3/Types/GCPData.cs @ 16828

Last change on this file since 16828 was 16565, checked in by gkronber, 5 years ago

#2520: merged changes from PersistenceOverhaul branch (r16451:16564) into trunk

File size: 1.9 KB
Line 
1#region License Information
2/* HeuristicLab
3 * Copyright (C) 2002-2019 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
22namespace HeuristicLab.Problems.Instances {
23  /// <summary>
24  /// Describes instances of the graph coloring problem (GCP).
25  /// </summary>
26  public class GCPData {
27    /// <summary>
28    /// The name of the instance
29    /// </summary>
30    public string Name { get; set; }
31    /// <summary>
32    /// Optional! The description of the instance
33    /// </summary>
34    public string Description { get; set; }
35
36    /// <summary>
37    /// The number of nodes in the graph
38    /// </summary>
39    public int Nodes { get; set; }
40    /// <summary>
41    /// An Nx2 adjacency list with N = Nodes
42    /// </summary>
43    public int[,] Adjacencies { get; set; }
44
45    /// <summary>
46    /// Optional! An array of length N with N = |Nodes|
47    /// </summary>
48    public int[] BestKnownColoring { get; set; }
49    /// <summary>
50    /// Optional! The least amount of colors that would not result in conflicts.
51    /// The amount of colors in <see cref="BestKnownColoring"/> if it is given as well.
52    /// </summary>
53    public int? BestKnownColors { get; set; }
54  }
55}
Note: See TracBrowser for help on using the repository browser.