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

Timestamp:

05/02/13 13:18:57 (11 years ago)

Author:

bburlacu

Message:

#1772: Refactoring of directed graph components, added code for correctly serializing vertices and edges. Added specific building blocks analyzers and new population diversity analyzer which correctly integrates with the parallel engine.

File:

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

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

@@ -201 +201 @@
       var qualities = SymbolicExpressionTreeQualityParameter.ActualValue.ToArray();
 
-      if (trees.Length != qualities.Length) throw new Exception("Error: trees and qualities array sizes do not match!");
+      if (trees.Length != qualities.Length)
+        throw new Exception("Error: trees and qualities array sizes do not match!");
 
       // add all individuals to the evolutionary graph
       int generation = Generations.Value;
 
-      var pairs = trees.Zip(qualities, (t, q) => new { Tree = t, Quality = q.Value }).OrderByDescending(x => x.Quality).ToList();
+      var pairs =
+        trees.Zip(qualities, (t, q) => new { Tree = t, Quality = q.Value }).OrderByDescending(x => x.Quality).ToList();
 
       if (generation == 0) {
@@ -214 +216 @@
           var quality = pair.Quality;
           graph.AddNode(new SymbolicExpressionGenealogyGraphNode {
-            SymbolicExpressionTree = tree, Quality = quality, Rank = generation
+            SymbolicExpressionTree = tree,
+            Quality = quality,
+            Rank = generation
           });
         }
@@ -231 +235 @@
         // 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();
+        (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) {
@@ -262 +268 @@
           continue;
         }
-        var parents = GlobalTraceMap[tree].Cast<ISymbolicExpressionTree>();
+        var parents = GlobalTraceMap[tree].Cast<ISymbolicExpressionTree>().ToList();
+        var fragment = GlobalFragmentMap[tree];
         foreach (var p in parents) {
           var nodes = graph.GetGraphNodes(p);
@@ -272 +279 @@
             throw new Exception("Source node cannot be null");
           }
-          var arc = new Arc { Source = sourceNode, Target = node, Data = GlobalFragmentMap[tree] };
+          var arc = new Arc { Source = sourceNode, Target = node, Data = fragment };
           sourceNode.AddForwardArc(arc);
           node.AddReverseArc(arc);
         }
+        // the root parent is the one that receives the subtree/fragment from the other parent
+        // so it does not actually pass a subtree to the child, therefore the fragment is null
+        // so in case of crossover, we add a null fragment below
+        if (parents.Count > 1) node.InEdges[0].Data = new Fragment(null);
       }
+
+      // notify listeners that the genealogy graph was updated
+      graph.Updated();
+
       return base.Apply();
     }