#region License Information
/* HeuristicLab
* Copyright (C) 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 .
*/
#endregion
namespace HeuristicLab.Problems.Instances {
///
/// Describes instances of the graph coloring problem (GCP).
///
public class GCPData {
///
/// The name of the instance
///
public string Name { get; set; }
///
/// Optional! The description of the instance
///
public string Description { get; set; }
///
/// The number of nodes in the graph
///
public int Nodes { get; set; }
///
/// An Nx2 adjacency list with N = Nodes
///
public int[,] Adjacencies { get; set; }
///
/// Optional! An array of length N with N = |Nodes|
///
public int[] BestKnownColoring { get; set; }
///
/// Optional! The least amount of colors that would not result in conflicts.
/// The amount of colors in if it is given as well.
///
public int? BestKnownColors { get; set; }
}
}