Changeset 10081 for branches/HeuristicLab.Analysis.AlgorithmBehavior/AlgorithmBehaviorUnitTests

Timestamp:

10/23/13 15:56:50 (11 years ago)

Author:

ascheibe

Message:

#1886 fixed LPHull, seems to work now

Location:

branches/HeuristicLab.Analysis.AlgorithmBehavior/AlgorithmBehaviorUnitTests

Files:

• ConvexHullTest.cs (modified) (1 diff)
• LPConvexHullTest.cs (modified) (2 diffs)

branches/HeuristicLab.Analysis.AlgorithmBehavior/AlgorithmBehaviorUnitTests/ConvexHullTest.cs

@@ -28 +28 @@
 using Microsoft.VisualStudio.TestTools.UnitTesting;
 
-namespace Visualization {
+namespace AlgorithmBehaviorUnitTests {
   [TestClass]
   public class ConvexHullTest {

branches/HeuristicLab.Analysis.AlgorithmBehavior/AlgorithmBehaviorUnitTests/LPConvexHullTest.cs

@@ -28 +28 @@
 using Microsoft.VisualStudio.TestTools.UnitTesting;
 
-namespace Visualization {
+namespace AlgorithmBehaviorUnitTests {
   [TestClass]
   public class LPConvexHullTest {
     [TestMethod]
     public void TestMethod1() {
-      int nrOfSamples = 10;
+      int nrOfSamples = 70;
       int sampleSize = 2;
       double[][] inputs = CreateRandomData(nrOfSamples, sampleSize);
@@ -70 +70 @@
     }
 
+    [TestMethod]
+    public void TestExt() {
+      var inputs = CreateDataExtremePoint1().ToList();
+      double[] alpha = inputs.Last();
+      bool result = LPHull.EXT(inputs, alpha, inputs.Count() - 1);
+      Assert.IsTrue(result);
+
+      inputs = CreateDataExtremePoint2().ToList();
+      alpha = inputs.Last();
+      result = LPHull.EXT(inputs, alpha, inputs.Count() - 1);
+      Assert.IsTrue(result);
+
+      inputs = CreateDataNonExtremePoint1().ToList();
+      alpha = inputs.Last();
+      result = LPHull.EXT(inputs, alpha, inputs.Count() - 1);
+      Assert.IsFalse(result);
+
+      inputs = CreateDataOnHull().ToList();
+      alpha = inputs.Last();
+      result = LPHull.EXT(inputs, alpha, inputs.Count() - 1);
+      Assert.IsFalse(result);
+    }
+
+    private double[][] CreateDataExtremePoint1() {
+      double[][] result = new double[5][];
+
+      result[0] = new double[] { 0.1, 0.1 };
+      result[1] = new double[] { 1, 1 };
+      result[2] = new double[] { 1, 0 };
+      result[3] = new double[] { 0, 1 };
+      result[4] = new double[] { 2.0, 1.4 };
+
+      return result;
+    }
+
+    private double[][] CreateDataExtremePoint2() {
+      double[][] result = new double[5][];
+
+      result[0] = new double[] { 0.1, 0.1 };
+      result[1] = new double[] { 1, 1 };
+      result[2] = new double[] { 1, 0 };
+      result[3] = new double[] { 0, 1 };
+      result[4] = new double[] { 1.0, 1.4 };
+
+      return result;
+    }
+
+    private double[][] CreateDataNonExtremePoint1() {
+      double[][] result = new double[5][];
+
+      result[0] = new double[] { 0.1, 0.1 };
+      result[1] = new double[] { 1, 1 };
+      result[2] = new double[] { 1, 0 };
+      result[3] = new double[] { 0, 1 };
+      result[4] = new double[] { 0.8, 0.4 };
+
+      return result;
+    }
+
+    private double[][] CreateDataOnHull() {
+      double[][] result = new double[5][];
+
+      result[0] = new double[] { 0.1, 0.1 };
+      result[1] = new double[] { 1, 1 };
+      result[2] = new double[] { 1, 0 };
+      result[3] = new double[] { 0, 1 };
+      result[4] = new double[] { 1.0, 0.5 };
+
+      return result;
+    }
+
     private List<DefaultVertex> ConvertPermutationToVertex(double[][] data) {
       List<DefaultVertex> result = new List<DefaultVertex>();