Free cookie consent management tool by TermsFeed Policy Generator

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

Last change on this file since 6949 was 6949, checked in by bburlacu, 11 years ago

#1654: Enhanced tree creator tests.

File size: 3.5 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 TestContext testContextInstance;
35
36    /// <summary>
37    ///Gets or sets the test context which provides
38    ///information about and functionality for the current test run.
39    ///</summary>
40    public TestContext TestContext {
41      get {
42        return testContextInstance;
43      }
44      set {
45        testContextInstance = value;
46      }
47    }
48
49    [TestMethod()]
50    public void FullTreeCreatorDistributionsTest() {
51      var randomTrees = new List<ISymbolicExpressionTree>();
52      var grammar = Grammars.CreateSimpleArithmeticGrammar();
53      var random = new MersenneTwister(31415);
54      var stopwatch = new Stopwatch();
55      stopwatch.Start();
56      for (int i = 0; i != POPULATION_SIZE; i++) {
57        randomTrees.Add(FullTreeCreator.Create(random, grammar, MAX_TREE_DEPTH));
58      }
59      stopwatch.Stop();
60      double msPerRandomTreeCreation = stopwatch.ElapsedMilliseconds / (double)POPULATION_SIZE;
61      int count = 0;
62      int depth = 0;
63      int maxLength = 0;
64      foreach (var tree in randomTrees) {
65        Util.IsValid(tree);
66        Assert.IsTrue(tree.Depth == MAX_TREE_DEPTH);
67        if (maxLength < tree.Length)
68          maxLength = tree.Length;
69        count += tree.Length;
70        depth += tree.Depth;
71      }
72
73      Console.WriteLine("FullTreeCreator: " + Environment.NewLine +
74        msPerRandomTreeCreation + " ms per random tree (~" +
75        Math.Round(1000.0 / (msPerRandomTreeCreation)) + "random trees / s)" + Environment.NewLine +
76        Util.GetSizeDistributionString(randomTrees, maxLength, 5) + Environment.NewLine +
77        Util.GetFunctionDistributionString(randomTrees) + Environment.NewLine +
78        Util.GetNumberOfSubtreesDistributionString(randomTrees) + Environment.NewLine +
79        Util.GetTerminalDistributionString(randomTrees) + Environment.NewLine +
80        "Average tree depth: " + depth / POPULATION_SIZE + Environment.NewLine +
81        "Average tree length: " + count / POPULATION_SIZE + Environment.NewLine +
82        "Maximum tree length: " + maxLength + Environment.NewLine +
83        "Total nodes created: " + count + Environment.NewLine
84        );
85      Assert.IsTrue(Math.Round(1000.0 / (msPerRandomTreeCreation)) > 300); // must achieve more than 300 random trees / s
86    }
87  }
88}
Note: See TracBrowser for help on using the repository browser.