[10752] | 1 |
|
---|
[10755] | 2 | using System;
|
---|
[10752] | 3 | using System.Collections.Generic;
|
---|
| 4 | using System.IO;
|
---|
| 5 | using System.Linq;
|
---|
| 6 | using HeuristicLab.Encodings.SymbolicExpressionTreeEncoding;
|
---|
| 7 | using HeuristicLab.EvolutionTracking;
|
---|
| 8 | using FragmentNode = HeuristicLab.EvolutionTracking.GenealogyGraphNode<HeuristicLab.EvolutionTracking.IFragment<HeuristicLab.Encodings.SymbolicExpressionTreeEncoding.ISymbolicExpressionTreeNode>>;
|
---|
| 9 | using IFragmentNode = HeuristicLab.EvolutionTracking.IGenealogyGraphNode<HeuristicLab.EvolutionTracking.IFragment<HeuristicLab.Encodings.SymbolicExpressionTreeEncoding.ISymbolicExpressionTreeNode>>;
|
---|
| 10 | using IGraphNode = HeuristicLab.EvolutionTracking.IGenealogyGraphNode<HeuristicLab.Encodings.SymbolicExpressionTreeEncoding.ISymbolicExpressionTree>;
|
---|
| 11 |
|
---|
| 12 | namespace HeuristicLab.Problems.DataAnalysis.Symbolic.Views {
|
---|
| 13 | public static class SymbolicDataAnalysisExpressionTracing {
|
---|
| 14 | public static IGenealogyGraph<IFragment<ISymbolicExpressionTreeNode>> TraceSubtree(IGenealogyGraphNode<ISymbolicExpressionTree> graphNode, int subtreeIndex) {
|
---|
| 15 | var graph = new GenealogyGraph<IFragment<ISymbolicExpressionTreeNode>>();
|
---|
| 16 | var nodes = Trace(graphNode, subtreeIndex);
|
---|
| 17 | foreach (var n in nodes) {
|
---|
| 18 | graph.AddVertex(n);
|
---|
| 19 | }
|
---|
| 20 | return graph;
|
---|
| 21 | }
|
---|
| 22 |
|
---|
| 23 | private static IEnumerable<IFragmentNode> Trace(IGraphNode graphNode, int subtreeIndex, FragmentNode parentNode = null) {
|
---|
| 24 | var node = graphNode; // current node
|
---|
| 25 | var index = subtreeIndex; // current index
|
---|
| 26 | var parent = parentNode; // current parent
|
---|
[10755] | 27 |
|
---|
[10752] | 28 | while (true) {
|
---|
[10755] | 29 | if (!node.Parents.Any()) {
|
---|
| 30 | var fragmentNode = new FragmentNode {
|
---|
| 31 | Content = new Fragment<ISymbolicExpressionTreeNode> { Root = node.Content.NodeAt(index) },
|
---|
| 32 | Rank = node.Rank
|
---|
| 33 | };
|
---|
| 34 | if (parent != null) {
|
---|
| 35 | var arc = new GenealogyGraphArc { Source = parent, Target = fragmentNode };
|
---|
| 36 | parent.AddForwardArc(arc);
|
---|
| 37 | // fragmentNode.Content.Index1 = parent.Content.Index1;
|
---|
| 38 | }
|
---|
| 39 | yield return fragmentNode; // no tracing if there are no parents
|
---|
| 40 | break;
|
---|
[10752] | 41 | }
|
---|
[10755] | 42 |
|
---|
[10752] | 43 | if (node.IsElite) {
|
---|
| 44 | node = node.Parents.First();
|
---|
| 45 | continue;
|
---|
[10755] | 46 | } // skip elite, go up the graph to original individual
|
---|
| 47 |
|
---|
| 48 | var tree = node.Content;
|
---|
| 49 | var subtree = tree.NodeAt(index);
|
---|
| 50 | var subtreeLength = subtree.GetLength();
|
---|
| 51 |
|
---|
[10752] | 52 | var fragment = (IFragment<ISymbolicExpressionTreeNode>)node.InArcs.Last().Data;
|
---|
| 53 | if (fragment == null) break;
|
---|
| 54 | var fragmentLength = fragment.Root.GetLength();
|
---|
[10755] | 55 |
|
---|
| 56 | if (fragment.Index1 == index) {
|
---|
[10752] | 57 | node = node.Parents.Last(); // take second parent which contains the fragment
|
---|
[10755] | 58 | index = fragment.Index2;
|
---|
| 59 | } else if (fragment.Index1 < index) {
|
---|
| 60 | if (fragment.Index1 + fragmentLength > index) {
|
---|
| 61 | node = node.Parents.Last(); // fragment contains subtree, take second parent
|
---|
| 62 | index += fragment.Index2 - fragment.Index1; // the subtree has the same index relative to the fragment
|
---|
| 63 | } else {
|
---|
| 64 | // fragment distinct from subtree
|
---|
[10752] | 65 | node = node.Parents.First(); // take first parent which contains the subtree
|
---|
[10755] | 66 | index += node.Content.NodeAt(fragment.Index1).GetLength() - fragmentLength; // subtreeIndex must be adjusted according to swapped fragments sizes
|
---|
[10752] | 67 | }
|
---|
[10755] | 68 | } else if (fragment.Index1 > index) {
|
---|
| 69 | if (fragment.Index1 < index + subtreeLength) {
|
---|
| 70 | // subtree contains fragment => bifurcation point in the fragment graph
|
---|
| 71 | var fragmentNode = new FragmentNode {
|
---|
| 72 | Content = new Fragment<ISymbolicExpressionTreeNode> { Root = subtree },
|
---|
| 73 | Rank = node.Rank
|
---|
| 74 | };
|
---|
| 75 | if (parent != null) {
|
---|
| 76 | var arc = new GenealogyGraphArc { Source = parent, Target = fragmentNode };
|
---|
| 77 | parent.AddForwardArc(arc);
|
---|
| 78 | }
|
---|
| 79 | fragmentNode.Content.Index1 = fragment.Index1 - index;
|
---|
| 80 | yield return fragmentNode;
|
---|
| 81 |
|
---|
[10752] | 82 | var left = Trace(node.Parents.First(), index, fragmentNode); // trace subtree
|
---|
[10755] | 83 |
|
---|
| 84 | if (node.Parents.Last().Content.NodeAt(fragment.Index2).GetLength() != fragmentLength) {
|
---|
| 85 | throw new Exception("Fragment lengths should match!");
|
---|
| 86 | }
|
---|
| 87 | var right = Trace(node.Parents.Last(), fragment.Index2, fragmentNode); // trace fragment
|
---|
[10797] | 88 | foreach (var v in left.Concat(right)) { yield return v; }
|
---|
[10752] | 89 | break;
|
---|
[10755] | 90 | } else {
|
---|
| 91 | node = node.Parents.First(); // fragment distinct from subtree: update node, index remains unchanged
|
---|
[10752] | 92 | }
|
---|
| 93 | }
|
---|
| 94 | }
|
---|
| 95 | }
|
---|
| 96 |
|
---|
| 97 | private static string ViewAsText(this ISymbolicExpressionTreeNode root) {
|
---|
| 98 | var writer = new StringWriter();
|
---|
| 99 | SymbolicExpressionTreeHierarchicalFormatter.RenderNode(writer, root, string.Empty);
|
---|
| 100 | return writer.ToString();
|
---|
| 101 | }
|
---|
| 102 | #region some helper methods for shortening the tracing code
|
---|
| 103 |
|
---|
| 104 | private static void AddChild(this IGenealogyGraphNode parent, IGenealogyGraphNode child) {
|
---|
| 105 | parent.AddForwardArc(child);
|
---|
| 106 | child.AddReverseArc(parent);
|
---|
| 107 | child.Rank = parent.Rank - 1;
|
---|
| 108 | }
|
---|
| 109 | private static ISymbolicExpressionTreeNode NodeAt(this ISymbolicExpressionTree tree, int position) {
|
---|
| 110 | return NodeAt(tree.Root, position);
|
---|
| 111 | }
|
---|
| 112 | private static ISymbolicExpressionTreeNode NodeAt(this ISymbolicExpressionTreeNode root, int position) {
|
---|
| 113 | return root.IterateNodesPrefix().ElementAt(position);
|
---|
| 114 | }
|
---|
| 115 | private static int IndexOf(this ISymbolicExpressionTree tree, ISymbolicExpressionTreeNode node) {
|
---|
| 116 | return IndexOf(tree.Root, node);
|
---|
| 117 | }
|
---|
| 118 | private static int IndexOf(this ISymbolicExpressionTreeNode root, ISymbolicExpressionTreeNode node) {
|
---|
| 119 | int i = 0;
|
---|
| 120 | foreach (var n in root.IterateNodesPrefix()) {
|
---|
| 121 | if (n == node) return i;
|
---|
| 122 | ++i;
|
---|
| 123 | }
|
---|
| 124 | return -1;
|
---|
| 125 | }
|
---|
| 126 | #endregion
|
---|
| 127 | }
|
---|
| 128 | }
|
---|