Changeset 16005 for branches/2864_PermutationProblems/HeuristicLab.Problems.Instances

Timestamp:

07/24/18 15:13:50 (6 years ago)

Author:

fholzing

Message:

#2864: Removed .Types from the LOPData.cs-Namespace

File:

• branches/2864_PermutationProblems/HeuristicLab.Problems.Instances/3.3/Types/LOPData.cs (modified) (1 diff)

branches/2864_PermutationProblems/HeuristicLab.Problems.Instances/3.3/Types/LOPData.cs

@@ -20 +20 @@
 #endregion
 
-using System;
-using System.Collections.Generic;
-using System.Linq;
-using System.Text;
-using System.Threading.Tasks;
 
-namespace HeuristicLab.Problems.Instances.Types
-{
+namespace HeuristicLab.Problems.Instances {
+  /// <summary>
+  /// Describes instances of the Linear Ordering Problem (LOP).
+  /// </summary>
+  public class LOPData {
     /// <summary>
-    /// Describes instances of the Linear Ordering Problem (LOP).
+    /// The name of the instance
     /// </summary>
-    public class LOPData
-    {
-        /// <summary>
-        /// The name of the instance
-        /// </summary>
-        public string Name { get; set; }
+    public string Name { get; set; }
 
-        /// <summary>
-        /// Optional! The description of the instance
-        /// </summary>
-        public string Description { get; set; }
+    /// <summary>
+    /// Optional! The description of the instance
+    /// </summary>
+    public string Description { get; set; }
 
-        /// <summary>
-        /// The size of the Matrix
-        /// </summary>
-        public int Dimension { get; set; }
+    /// <summary>
+    /// The size of the Matrix
+    /// </summary>
+    public int Dimension { get; set; }
 
-        /// <summary>
-        /// An NxN Matrix
-        /// </summary>
-        public double[,] Matrix { get; set; }
+    /// <summary>
+    /// An NxN Matrix
+    /// </summary>
+    public double[,] Matrix { get; set; }
 
-        /// <summary>
-        /// Optional! The best known Permutation
-        /// </summary>
-        public int[] BestKnownPermutation { get; set; }
+    /// <summary>
+    /// Optional! The best known Permutation
+    /// </summary>
+    public int[] BestKnownPermutation { get; set; }
 
-        /// <summary>
-        /// Optional! The quality value of the <see cref="BestKnownPermutation"/>
-        /// </summary>
-        public double? BestKnownQuality { get; set; }
-    }
+    /// <summary>
+    /// Optional! The quality value of the <see cref="BestKnownPermutation"/>
+    /// </summary>
+    public double? BestKnownQuality { get; set; }
+  }
 }