source: trunk/sources/HeuristicLab.Problems.TravelingSalesman/3.3/Interfaces/IBestTSPSolutionAnalyzer.cs @ 3635

#region License Information
/* HeuristicLab
 * Copyright (C) 2002-2010 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 HeuristicLab.Core;
using HeuristicLab.Data;
using HeuristicLab.Optimization;

namespace HeuristicLab.Problems.TravelingSalesman {
  /// <summary>
  /// An interface which represents operators for analyzing the best solution of Traveling Salesman Problems given in path representation using city coordinates.
  /// </summary>
  public interface IBestTSPSolutionAnalyzer : IAnalyzer {
    ILookupParameter<DoubleMatrix> CoordinatesParameter { get; }
    ILookupParameter PermutationParameter { get; }
    ILookupParameter QualityParameter { get; }
    ILookupParameter<PathTSPTour> BestSolutionParameter { get; }
    IValueLookupParameter<ResultCollection> ResultsParameter { get; }
  }
}