Changeset 12231 for branches/HeuristicLab.EvolutionTracking/HeuristicLab.Problems.DataAnalysis.Symbolic.Views/3.4

Timestamp:

03/20/15 18:20:59 (10 years ago)

Author:

bburlacu

Message:

#1772: Changed the way node highlighting is performed (taking into account sampling count relative to current generation). Made NodeWeight field storable in the SymbolicExpressionTreeNode. Updated the statistics counting in the TraceCalculator.

Location:

branches/HeuristicLab.EvolutionTracking/HeuristicLab.Problems.DataAnalysis.Symbolic.Views/3.4/Tracking

Files:

• SymbolicDataAnalysisGenealogyGraphView.cs (modified) (2 diffs)
• SymbolicExpressionChartControl.cs (deleted)

branches/HeuristicLab.EvolutionTracking/HeuristicLab.Problems.DataAnalysis.Symbolic.Views/3.4/Tracking/SymbolicDataAnalysisGenealogyGraphView.cs

@@ -100 +100 @@
         var fragment = data as IFragment<ISymbolicExpressionTreeNode>;
         var td = data as TraceData;
-        //        double max = Content.Vertices.SelectMany(x => x.Data.IterateNodesPrefix()).Max(x => x.NodeWeight);
-
+        //        double max = Content.Vertices.Max(x => x.Data.IterateNodesPrefix().Max(y => y.NodeWeight));
+
+        // calculate max only in the current generation
+        double max = Content.GetByRank(graphNode.Rank).Max(x => ((IGenealogyGraphNode<ISymbolicExpressionTree>)x).Data.IterateNodesPrefix().Max(y => y.NodeWeight));
+        if (max.IsAlmost(0)) max = 1;
+        int c = ColorGradient.Colors.Count - 1;
+        const int alpha = 100;
         if (fragment != null) {
-          //          treeChart_HighlightSubtree(graphNode.Data.NodeAt(fragment.Index1));
+          // highlight the fragment with a blue line color
+          foreach (var n in graphNode.Data.NodeAt(fragment.Index1).IterateNodesPrefix()) {
+            treeChart_HighlightSubtree(n, Color.CornflowerBlue);
+          }
+          // highlight all the nodes according to their sample count
           var nodes = graphNode.Data.IterateNodesPrefix().ToList();
-          int c = ColorGradient.Colors.Count - 1;
+          foreach (var n in nodes.Skip(1)) {
+            var i = (int)Math.Round(n.NodeWeight / max * c);
+            var fillColor = Color.FromArgb(alpha, ColorGradient.Colors[i]);
+            treeChart_HighlightSubtree(n, null, fillColor);
+          }
+        } else if (td != null) {
+          var nodes = graphNode.Data.IterateNodesPrefix().ToList();
           foreach (var n in nodes.Skip(1)) { // skip program root symbol 
-            //            var i = (int)Math.Round(n.NodeWeight / max * c);
-            //            const int alpha = 50;
-            //            var fillColor = Color.FromArgb(alpha, ColorGradient.Colors[i]);
-
-            //            treeChart_HighlightSubtree(n, null, fillColor);
-          }
-        } else if (td != null) {
-
-          var nodes = graphNode.Data.IterateNodesPrefix().ToList();
-          int c = ColorGradient.Colors.Count - 1;
-          foreach (var n in nodes.Skip(1)) { // skip program root symbol 
-            //            var i = (int)Math.Round(n.NodeWeight / max * c);
-            //            const int alpha = 50;
-            //            var fillColor = Color.FromArgb(alpha, ColorGradient.Colors[i]);
-
-            //            treeChart_HighlightSubtree(n, null, fillColor);
-          }
-
+            var i = (int)Math.Round(n.NodeWeight / max * c);
+            var fillColor = Color.FromArgb(alpha, ColorGradient.Colors[i]);
+            treeChart_HighlightSubtree(n, null, fillColor);
+          }
           treeChart_HighlightSubtree(nodes[td.LastSubtreeIndex], Color.Orange);
           treeChart_HighlightSubtree(nodes[td.LastFragmentIndex], Color.CornflowerBlue);
@@ -141 +142 @@
 
       switch (args.Button) {
-        case MouseButtons.Left:
-          SelectedSubtree = subtree;
-          if (trace) {
-            // perform fragment tracing
-            var graphNode = (IGenealogyGraphNode<ISymbolicExpressionTree>)genealogyGraphChart.SelectedGraphNode;
-            var subtreeIndex = graphNode.Data.IterateNodesPrefix().ToList().IndexOf(subtree);
-            var traceGraph = TraceCalculator.TraceSubtree(graphNode, subtreeIndex, updateVertexWeights: true, updateSubtreeWeights: true, cacheTraceNodes: true);
-            if (traceGraph.Vertices.Any()) {
-              genealogyGraphChart.UpdateEnabled = false;
-              genealogyGraphChart.ClearPrimitives();
-              var traceVertices = traceGraph.Vertices.ToList();
-              var genealogyNodes = traceVertices.Select(v => Content.GetByContent(v.Data)).ToList();
-              // color graph vertices according to their weight
-              double max = traceGraph.Vertices.Max(x => x.Data.IterateNodesPrefix().Max(n => x.Weight));
-              for (int i = 0; i < genealogyNodes.Count; ++i) {
-                var g = genealogyNodes[i];
-                g.Weight = traceVertices[i].Weight;
-                var v = genealogyGraphChart.GetMappedNode(g);
-                if (v != null) {
-                  v.Brush = new SolidBrush(ColorGradient.Colors[(int)Math.Round(g.Weight * (ColorGradient.Colors.Count - 1) / max)]);
+        case MouseButtons.Left: {
+            SelectedSubtree = subtree;
+            if (trace) {
+              // TODO: maybe highlight based on per generation maximum
+              double max = Content.Vertices.Max(x => x.Data.IterateNodesPrefix().Average(y => y.NodeWeight));
+              // perform fragment tracing
+              var graphNode = (IGenealogyGraphNode<ISymbolicExpressionTree>)genealogyGraphChart.SelectedGraphNode;
+              var subtreeIndex = graphNode.Data.IterateNodesPrefix().ToList().IndexOf(subtree);
+              var traceGraph = TraceCalculator.TraceSubtree(graphNode, subtreeIndex, updateVertexWeights: false, updateSubtreeWeights: false, cacheTraceNodes: true);
+              if (traceGraph.Vertices.Any()) {
+                var vertices = traceGraph.Vertices.Select(x => Content.GetByContent(x.Data));
+                genealogyGraphChart.UpdateEnabled = false;
+                genealogyGraphChart.ClearPrimitives();
+                foreach (var v in vertices) {
+                  var vNode = genealogyGraphChart.GetMappedNode(v);
+                  var wSum = v.Data.IterateNodesPrefix().Average(x => x.NodeWeight);
+                  // use a grayscal gradient
+                  var color = ColorGradient.GrayscaledColors[(int)Math.Round(wSum / max * (ColorGradient.GrayscaledColors.Count - 1))];
+                  vNode.Brush = new SolidBrush(color);
+                }
+                genealogyGraphChart.UpdateEnabled = true;
+                genealogyGraphChart.EnforceUpdate();
+
+                if (openNew_CheckBox.Checked) {
+                  MainFormManager.MainForm.ShowContent(traceGraph); // display the fragment graph on the screen
                 }
               }
-
-              genealogyGraphChart.UpdateEnabled = true;
-              genealogyGraphChart.EnforceUpdate();
-
-              if (openNew_CheckBox.Checked)
-                MainFormManager.MainForm.ShowContent(traceGraph); // display the fragment graph on the screen
+            } else {
+              // perform matching like it was done before
+              // currently there is no possibility to specify the subtree matching criteria
+              var trees = Content.Vertices.Select(x => x.Data);
+              var matchingTrees = trees.Where(x => x.Root.ContainsSubtree(subtree, comparer));
+
+              var matchingVertices = matchingTrees.Select(x => Content.GetByContent(x));
+              graphChart_HighlightMatchingVertices(matchingVertices);
             }
-          } else {
-            // perform matching like it was done before
-            // currently there is no possibility to specify the subtree matching criteria
-            var trees = Content.Vertices.Select(x => x.Data);
-            var matchingTrees = trees.Where(x => x.Root.ContainsSubtree(subtree, comparer));
-
-            var matchingVertices = matchingTrees.Select(x => Content.GetByContent(x));
-            graphChart_HighlightMatchingVertices(matchingVertices);
-          }
-          break;
-        case MouseButtons.Middle:
-          var index = SelectedSubtree.IterateNodesPrefix().ToList().IndexOf(subtree);
-          if (index > 0) {
-            var s = ClonedSubtree.NodeAt(index);
-            s.Parent.RemoveSubtree(s.Parent.IndexOfSubtree(s));
-
-            var trees = Content.Vertices.Select(x => x.Data);
-            var matchingTrees = trees.Where(x => x.Root.ContainsSubtree(ClonedSubtree, comparer));
-
-            var matchingVertices = matchingTrees.Select(x => Content.GetByContent(x));
-            treeChart_HighlightSubtree(subtree, Color.Black, Color.White);
-            graphChart_HighlightMatchingVertices(matchingVertices);
-          }
-          break;
+            break;
+          }
+        case MouseButtons.Middle: {
+            var index = SelectedSubtree.IterateNodesPrefix().ToList().IndexOf(subtree);
+            if (index > 0) {
+              var s = ClonedSubtree.NodeAt(index);
+              s.Parent.RemoveSubtree(s.Parent.IndexOfSubtree(s));
+
+              var trees = Content.Vertices.Select(x => x.Data);
+              var matchingTrees = trees.Where(x => x.Root.ContainsSubtree(ClonedSubtree, comparer));
+
+              var matchingVertices = matchingTrees.Select(x => Content.GetByContent(x));
+              treeChart_HighlightSubtree(subtree, Color.Black, Color.White);
+              graphChart_HighlightMatchingVertices(matchingVertices);
+            }
+            break;
+          }
       }
     }