source: trunk/sources/HeuristicLab.Tests/HeuristicLab.Encodings.SymbolicExpressionTreeEncoding-3.4/FullTreeCreatorTest.cs @ 7053

Last change on this file since 7053 was 7053, checked in by mkommend, 8 years ago

#1654: Corrected TreeCreator unit tests.

File size: 3.6 KB
Line 
1#region License Information
2/* HeuristicLab
3 * Copyright (C) 2002-2011 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
22using System;
23using System.Collections.Generic;
24using System.Diagnostics;
25using HeuristicLab.Encodings.SymbolicExpressionTreeEncoding;
26using HeuristicLab.Random;
27using Microsoft.VisualStudio.TestTools.UnitTesting;
28
29namespace HeuristicLab.Encodings.SymbolicExpressionTreeEncoding_3._4.Tests {
30  [TestClass]
31  public class FullTreeCreatorTest {
32    private const int POPULATION_SIZE = 10000;
33    private const int MAX_TREE_DEPTH = 10;
34    private const int MAX_TREE_LENGTH = 1000;
35    private TestContext testContextInstance;
36
37    /// <summary>
38    ///Gets or sets the test context which provides
39    ///information about and functionality for the current test run.
40    ///</summary>
41    public TestContext TestContext {
42      get {
43        return testContextInstance;
44      }
45      set {
46        testContextInstance = value;
47      }
48    }
49
50    [TestMethod()]
51    public void FullTreeCreatorDistributionsTest() {
52      var randomTrees = new List<ISymbolicExpressionTree>();
53      var grammar = Grammars.CreateSimpleArithmeticGrammar();
54      var random = new MersenneTwister(31415);
55      var stopwatch = new Stopwatch();
56      stopwatch.Start();
57      for (int i = 0; i != POPULATION_SIZE; i++) {
58        randomTrees.Add(FullTreeCreator.Create(random, grammar, MAX_TREE_LENGTH, MAX_TREE_DEPTH));
59      }
60      stopwatch.Stop();
61      double msPerRandomTreeCreation = stopwatch.ElapsedMilliseconds / (double)POPULATION_SIZE;
62      int count = 0;
63      int depth = 0;
64      int maxLength = 0;
65      foreach (var tree in randomTrees) {
66        Util.IsValid(tree);
67        Assert.IsTrue(tree.Depth == MAX_TREE_DEPTH);
68        if (maxLength < tree.Length)
69          maxLength = tree.Length;
70        count += tree.Length;
71        depth += tree.Depth;
72      }
73
74      Console.WriteLine("FullTreeCreator: " + Environment.NewLine +
75        msPerRandomTreeCreation + " ms per random tree (~" +
76        Math.Round(1000.0 / (msPerRandomTreeCreation)) + "random trees / s)" + Environment.NewLine +
77        Util.GetSizeDistributionString(randomTrees, maxLength, 5) + Environment.NewLine +
78        Util.GetFunctionDistributionString(randomTrees) + Environment.NewLine +
79        Util.GetNumberOfSubtreesDistributionString(randomTrees) + Environment.NewLine +
80        Util.GetTerminalDistributionString(randomTrees) + Environment.NewLine +
81        "Average tree depth: " + depth / POPULATION_SIZE + Environment.NewLine +
82        "Average tree length: " + count / POPULATION_SIZE + Environment.NewLine +
83        "Maximum tree length: " + maxLength + Environment.NewLine +
84        "Total nodes created: " + count + Environment.NewLine
85        );
86      Assert.IsTrue(Math.Round(1000.0 / (msPerRandomTreeCreation)) > 300); // must achieve more than 300 random trees / s
87    }
88  }
89}
Note: See TracBrowser for help on using the repository browser.