Changeset 9238 for branches/HeuristicLab.EvolutionaryTracking/HeuristicLab.EvolutionaryTracking/3.4/Operators/SymbolicExpressionTreeGenealogyGraphBuilder.cs

Timestamp:

02/21/13 16:02:47 (11 years ago)

Author:

bburlacu

Message:

#1772: Added base class for the fragment analyzers. Improved analyzers, added SymbolicExpressionTreeRelativeFragmentDepthAnalyzer. Added LineageExplorer.

File:

• branches/HeuristicLab.EvolutionaryTracking/HeuristicLab.EvolutionaryTracking/3.4/Operators/SymbolicExpressionTreeGenealogyGraphBuilder.cs (modified) (7 diffs)

branches/HeuristicLab.EvolutionaryTracking/HeuristicLab.EvolutionaryTracking/3.4/Operators/SymbolicExpressionTreeGenealogyGraphBuilder.cs

@@ -21 +21 @@
 
 using System;
-using System.Collections.Generic;
 using System.Linq;
 using System.Threading;
@@ -63 +62 @@
     private const string SymbolicExpressionTreeQualityParameterName = "Quality";
     #endregion
-    #region Parameter properties
+    #region Parameters
     public IScopeTreeLookupParameter<ISymbolicExpressionTree> SymbolicExpressionTreeParameter {
       get { return (IScopeTreeLookupParameter<ISymbolicExpressionTree>)Parameters[SymbolicExpressionTreeParameterName]; }
@@ -109 +108 @@
     }
     #endregion
-    #region Properties
+    #region Parameter properties
     public bool EnabledByDefault {
       get { return true; }
@@ -189 +188 @@
 
     public override IOperation Apply() {
-      if (GlobalTraceMap == null) return base.Apply(); // no trace map, no genealogy graph
-
       if (!Parameters.ContainsKey("Results")) return base.Apply();
 
@@ -211 +208 @@
       var pairs = trees.Zip(qualities, (t, q) => new { Tree = t, Quality = q.Value }).OrderByDescending(x => x.Quality).ToList();
 
-      var graphNodes = new List<SymbolicExpressionGenealogyGraphNode>(
-        (from i in Enumerable.Range(0, trees.Length)
-         let tree = pairs[i].Tree
-         let quality = pairs[i].Quality
-         select new SymbolicExpressionGenealogyGraphNode { SymbolicExpressionTree = tree, Quality = quality, Rank = generation, IsElite = i < Elites.Value }
-        ).Concat
-        (from t in trees
-         where GlobalTraceMap.ContainsKey(t)
-         let parents = GlobalTraceMap[t]
-         where parents.Count == 1 // 1 parent means mutation
-         let p = (ISymbolicExpressionTree)parents[0]
-         select new SymbolicExpressionGenealogyGraphNode { SymbolicExpressionTree = p, Quality = Evaluate(p), Rank = generation - 0.5 }
-        )).ToList();
+      if (generation == 0) {
+        // add the trees in the graph and return
+        foreach (var pair in pairs) {
+          var tree = pair.Tree;
+          var quality = pair.Quality;
+          graph.AddNode(new SymbolicExpressionGenealogyGraphNode {
+            SymbolicExpressionTree = tree, Quality = quality, Rank = generation
+          });
+        }
+        return base.Apply();
+      }
+
+      var graphNodes = (from i in Enumerable.Range(0, trees.Length)
+                        let tree = pairs[i].Tree
+                        let quality = pairs[i].Quality
+                        select new SymbolicExpressionGenealogyGraphNode {
+                          SymbolicExpressionTree = tree,
+                          Quality = quality,
+                          Rank = generation,
+                          IsElite = i < Elites.Value
+                        }).Concat
+        // the following query addds the intermediate nodes that were created when 
+        // crossover was followed by mutation (they are not present in the scope) 
+                        (from t in trees
+                         where GlobalTraceMap.ContainsKey(t)
+                         let parents = GlobalTraceMap[t]
+                         where parents.Count == 1 // 1 parent means mutation
+                         let p = (ISymbolicExpressionTree)parents[0]
+                         select new SymbolicExpressionGenealogyGraphNode {
+                           SymbolicExpressionTree = p,
+                           Quality = Evaluate(p),
+                           Rank = generation - 0.5 // an intermediate parent that would normale be 'invisible' to the evolutionary process
+                         }
+                        ).ToList();
 
       foreach (var node in graphNodes) {
@@ -229 +247 @@
       }
 
+      graphNodes.Sort((a, b) => b.Rank.CompareTo(a.Rank));
+
       foreach (var node in graphNodes) {
         var tree = node.SymbolicExpressionTree;
-        if (!GlobalTraceMap.ContainsKey(tree)) continue;
+        if (!GlobalTraceMap.ContainsKey(tree)) {
+          continue;
+        }
         var parents = GlobalTraceMap[tree].Cast<ISymbolicExpressionTree>();
         foreach (var p in parents) {
           var nodes = graph.GetGraphNodes(p);
-          if (nodes == null) continue;
+          if (nodes == null) {
+            throw new Exception("Node cannot have no parents");
+          }
           var sourceNode = nodes.LastOrDefault(n => n.Rank < node.Rank);
-          if (sourceNode == null) continue;
+          if (sourceNode == null) {
+            throw new Exception("Source node cannot be null");
+          }
           var arc = new Arc { Source = sourceNode, Target = node, Data = GlobalFragmentMap[tree] };
           sourceNode.AddForwardArc(arc);
@@ -249 +275 @@
     /// Evaluate a symbolic expression tree. We perform evaluation by adding a temporary subscope with the tree in it, and calling evaluator.Apply()
     /// </summary>
-    /// <param name="tree"></param>
-    /// <returns></returns>
+    /// <param name="tree">The symbolic expression tree to evaluate</param>
+    /// <returns>A double value representing the fitness</returns>
     private double Evaluate(IItem tree) {
       var subScope = new Scope();