Changeset 10565 for trunk/sources
- Timestamp:
- 03/07/14 16:23:41 (10 years ago)
- Location:
- trunk/sources/HeuristicLab.Encodings.SymbolicExpressionTreeEncoding.Views/3.4
- Files:
-
- 6 edited
Legend:
- Unmodified
- Added
- Removed
-
trunk/sources/HeuristicLab.Encodings.SymbolicExpressionTreeEncoding.Views/3.4/Formatters/SymbolicExpressionTreeLatexFormatter.cs
r10520 r10565 22 22 using System; 23 23 using System.Collections.Generic; 24 using System.Drawing; 24 25 using System.Globalization; 25 26 using System.Linq; … … 36 37 {"StartSymbol","RPB"} 37 38 }; 38 private readonly ReingoldTilfordLayoutEngine<ISymbolicExpressionTreeNode> layoutEngine = new ReingoldTilfordLayoutEngine<ISymbolicExpressionTreeNode>(); 39 40 private readonly ReingoldTilfordLayoutEngine<ISymbolicExpressionTreeNode> layoutEngine; 39 41 40 42 public SymbolicExpressionTreeLatexFormatter() 41 43 : base("LaTeX/PDF Formatter", "Formatter for symbolic expression trees for use with latex package tikz.") { 42 layoutEngine = new ReingoldTilfordLayoutEngine<ISymbolicExpressionTreeNode> {44 layoutEngine = new ReingoldTilfordLayoutEngine<ISymbolicExpressionTreeNode>(n => n.Subtrees) { 43 45 HorizontalSpacing = 2, 44 46 VerticalSpacing = 2, … … 57 59 58 60 public string Format(ISymbolicExpressionTree symbolicExpressionTree) { 59 layoutEngine.Reset();60 61 var root = symbolicExpressionTree.Root; 61 62 var actualRoot = root.SubtreeCount == 0 ? root.GetSubtree(0) : root; 62 layoutEngine.Initialize(actualRoot, x => x.Subtrees); 63 layoutEngine.CalculateLayout(); 64 var nodeCoordinates = layoutEngine.GetCoordinates(); 63 var nodeCoordinates = layoutEngine.CalculateLayout(actualRoot).ToDictionary(n => n.Content, n => new PointF(n.X, n.Y)); 65 64 var sb = new StringBuilder(); 66 65 var nl = Environment.NewLine; -
trunk/sources/HeuristicLab.Encodings.SymbolicExpressionTreeEncoding.Views/3.4/LayoutEngines/BoxesLayoutEngine.cs
r10561 r10565 1 1 #region License Information 2 3 /* HeuristicLab 4 * Copyright (C) 2002-2014 Heuristic and Evolutionary Algorithms Laboratory (HEAL) 5 * 6 * This file is part of HeuristicLab. 7 * 8 * HeuristicLab is free software: you can redistribute it and/or modify 9 * it under the terms of the GNU General Public License as published by 10 * the Free Software Foundation, either version 3 of the License, or 11 * (at your option) any later version. 12 * 13 * HeuristicLab is distributed in the hope that it will be useful, 14 * but WITHOUT ANY WARRANTY; without even the implied warranty of 15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 16 * GNU General Public License for more details. 17 * 18 * You should have received a copy of the GNU General Public License 19 * along with HeuristicLab. If not, see <http://www.gnu.org/licenses/>. 20 */ 21 22 #endregion 23 2 24 using System; 3 25 using System.Collections.Generic; 4 using System.Drawing;5 26 using System.Linq; 6 27 7 28 namespace HeuristicLab.Encodings.SymbolicExpressionTreeEncoding.Views { 8 29 public class BoxesLayoutEngine<T> : ILayoutEngine<T> where T : class { 9 private readonly Dictionary<T, VisualTreeNode<T>> nodeMap;10 11 30 public int NodeWidth { get; set; } 12 31 public int NodeHeight { get; set; } 13 32 public int HorizontalSpacing { get; set; } 14 33 public int VerticalSpacing { get; set; } 15 private VisualTreeNode<T> layoutRoot;16 34 17 public int Width { get; private set; } 18 public int Height { get; private set; } 35 private readonly Func<T, IEnumerable<T>> GetChildren; 36 private readonly Func<T, int> GetLength; 37 private readonly Func<T, int> GetDepth; 19 38 20 public Func<T, IEnumerable<T>> GetChildren { get; set; } 21 public Func<T, int> GetLength { get; set; } 22 public Func<T, int> GetDepth { get; set; } 39 public BoxesLayoutEngine(Func<T, IEnumerable<T>> GetChildren, Func<T, int> GetLength, Func<T, int> GetDepth) { 40 if (GetChildren == null) throw new ArgumentNullException("GetChildren"); 41 if (GetLength == null) throw new ArgumentNullException("GetLength"); 42 if (GetDepth == null) throw new ArgumentNullException("GetDepth"); 23 43 24 public BoxesLayoutEngine() { 25 nodeMap = new Dictionary<T, VisualTreeNode<T>>(); 44 this.GetChildren = GetChildren; 45 this.GetLength = GetLength; 46 this.GetDepth = GetDepth; 26 47 } 27 48 28 public void CalculateLayout() { 29 throw new Exception("The BoxesLayoutEngine does not support arbitrary bounds. Please use method CalculateLayout(Width, Height)"); 49 50 public IEnumerable<VisualTreeNode<T>> CalculateLayout(T root, float width, float height) { 51 var nodeMap = new Dictionary<T, VisualTreeNode<T>>(); 52 CreateVisualNodes(root, nodeMap); 53 RecursiveLayout(nodeMap, nodeMap[root], 0, 0, (int)Math.Round(width), (int)Math.Round(height) / GetDepth(root)); 54 return nodeMap.Values; 30 55 } 31 56 32 public void CalculateLayout(float width, float height) { 33 Width = (int)Math.Round(width); 34 Height = (int)Math.Round(height); 35 Reset(); 36 RecursiveLayout(layoutRoot, 0, 0, Width, Height / GetDepth(layoutRoot.Content)); 37 } 38 39 public void Initialize(T root, Func<T, IEnumerable<T>> getChildren, Func<T, int> getLength, Func<T, int> getDepth) { 40 if (getChildren == null || getLength == null || getDepth == null) 41 throw new ArgumentNullException("The BoxesLayoutEngine requires all of the lambdas: (getChildren, getLength and getDepth) to be defined."); 42 GetChildren = getChildren; 43 GetLength = getLength; 44 GetDepth = getDepth; 45 Clear(); 46 Expand(root); // produce the nodeMap 47 layoutRoot = nodeMap[root]; 48 } 49 50 private void Expand(T root) { 57 private void CreateVisualNodes(T root, Dictionary<T, VisualTreeNode<T>> map) { 51 58 var node = new VisualTreeNode<T>(root) { 52 59 PreferredWidth = NodeWidth, 53 60 PreferredHeight = NodeHeight 54 61 }; 55 nodeMap.Add(root, node); 62 63 map.Add(root, node); 56 64 var children = GetChildren(root).ToList(); 57 65 if (children.Any()) { 58 66 foreach (var child in children) { 59 Expand(child);67 CreateVisualNodes(child, map); 60 68 } 61 69 } 62 70 } 63 71 64 public void Center(float width, float height) { 65 // does nothing because the BoxesLayout centers the tree by default 66 } 67 68 public void Clear() { 69 nodeMap.Clear(); 70 layoutRoot = null; 71 } 72 73 public void Reset() { 74 foreach (var node in nodeMap.Values) { 75 node.X = 0; 76 node.Y = 0; 77 } 78 } 79 80 public Dictionary<T, PointF> GetCoordinates() { 81 return nodeMap.ToDictionary(x => x.Key, x => new PointF(x.Value.X, x.Value.Y)); 82 } 83 84 public void FitToBounds(float width, float height) { 85 // does nothing because the BoxesLayout is by default stretched on the whole drawing area 86 } 87 88 private void RecursiveLayout(VisualTreeNode<T> visualTreeNode, int x, int y, int width, int height) { 72 private void RecursiveLayout(Dictionary<T, VisualTreeNode<T>> nodeMap, VisualTreeNode<T> visualTreeNode, int x, int y, int width, int height) { 89 73 float center_x = x + width / 2; 90 74 float center_y = y + height / 2; … … 127 111 for (int i = 0; i < children.Count; i++) { 128 112 xBoundaries[i + 1] = (int)(xBoundaries[i] + (width * (double)GetLength(children[i])) / (GetLength(node) - 1)); 129 RecursiveLayout(nodeMap [children[i]], xBoundaries[i], y + height, xBoundaries[i + 1] - xBoundaries[i], height);113 RecursiveLayout(nodeMap, nodeMap[children[i]], xBoundaries[i], y + height, xBoundaries[i + 1] - xBoundaries[i], height); 130 114 } 131 }132 133 public IEnumerable<T> GetContentNodes() {134 return nodeMap.Keys;135 }136 137 public IEnumerable<VisualTreeNode<T>> GetVisualNodes() {138 return nodeMap.Values;139 115 } 140 116 } -
trunk/sources/HeuristicLab.Encodings.SymbolicExpressionTreeEncoding.Views/3.4/LayoutEngines/ILayoutEngine.cs
r10561 r10565 1 2 using System; 1 #region License Information 2 3 /* HeuristicLab 4 * Copyright (C) 2002-2014 Heuristic and Evolutionary Algorithms Laboratory (HEAL) 5 * 6 * This file is part of HeuristicLab. 7 * 8 * HeuristicLab is free software: you can redistribute it and/or modify 9 * it under the terms of the GNU General Public License as published by 10 * the Free Software Foundation, either version 3 of the License, or 11 * (at your option) any later version. 12 * 13 * HeuristicLab is distributed in the hope that it will be useful, 14 * but WITHOUT ANY WARRANTY; without even the implied warranty of 15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 16 * GNU General Public License for more details. 17 * 18 * You should have received a copy of the GNU General Public License 19 * along with HeuristicLab. If not, see <http://www.gnu.org/licenses/>. 20 */ 21 22 #endregion 23 3 24 using System.Collections.Generic; 4 using System.Drawing;5 25 6 26 namespace HeuristicLab.Encodings.SymbolicExpressionTreeEncoding.Views { … … 11 31 int VerticalSpacing { get; set; } 12 32 13 void CalculateLayout(); 14 void CalculateLayout(float width, float height); 15 void Initialize(T root, Func<T, IEnumerable<T>> getChildren, Func<T, int> getLength = null, Func<T, int> getDepth = null); 16 void Clear(); 17 void Reset(); 18 19 // function members necessary to navigate the tree structure 20 Func<T, IEnumerable<T>> GetChildren { get; set; } 21 Func<T, int> GetLength { get; set; } 22 Func<T, int> GetDepth { get; set; } 23 24 IEnumerable<T> GetContentNodes(); 25 IEnumerable<VisualTreeNode<T>> GetVisualNodes(); 26 Dictionary<T, PointF> GetCoordinates(); 33 IEnumerable<VisualTreeNode<T>> CalculateLayout(T root, float width, float height); 27 34 } 28 35 } -
trunk/sources/HeuristicLab.Encodings.SymbolicExpressionTreeEncoding.Views/3.4/LayoutEngines/LayoutNode.cs
r10520 r10565 25 25 26 26 namespace HeuristicLab.Encodings.SymbolicExpressionTreeEncoding.Views { 27 publicclass LayoutNode<T> : object where T : class {27 internal class LayoutNode<T> : object where T : class { 28 28 public float Width { get; set; } 29 29 public float Height { get; set; } -
trunk/sources/HeuristicLab.Encodings.SymbolicExpressionTreeEncoding.Views/3.4/LayoutEngines/ReingoldTilfordLayoutEngine.cs
r10561 r10565 7 7 namespace HeuristicLab.Encodings.SymbolicExpressionTreeEncoding.Views { 8 8 public class ReingoldTilfordLayoutEngine<T> : ILayoutEngine<T> where T : class { 9 private readonly Dictionary<T, LayoutNode<T>> nodeMap; // provides a reverse mapping T => LayoutNode10 9 public int NodeWidth { get; set; } 11 10 public int NodeHeight { get; set; } … … 22 21 } 23 22 24 public Func<T, IEnumerable<T>> GetChildren { get; set; } 25 public Func<T, int> GetLength { get; set; } 26 public Func<T, int> GetDepth { get; set; } 27 private LayoutNode<T> layoutRoot; 28 29 public ReingoldTilfordLayoutEngine() { 30 nodeMap = new Dictionary<T, LayoutNode<T>>(); 31 } 32 33 public ReingoldTilfordLayoutEngine(T root, Func<T, IEnumerable<T>> childrenFunc) 34 : this() { 35 Initialize(root, childrenFunc); 36 } 37 38 public void Initialize(T root, Func<T, IEnumerable<T>> getChildren, Func<T, int> getLength = null, Func<T, int> getDepth = null) { 39 GetChildren = getChildren; 40 Clear(); 41 var node = new LayoutNode<T> { Content = root, Width = NodeWidth, Height = NodeHeight }; 42 node.Ancestor = node; 43 layoutRoot = node; 44 Expand(node); 45 } 46 47 private void Expand(LayoutNode<T> lRoot) { 48 nodeMap.Add(lRoot.Content, lRoot); 23 private readonly Func<T, IEnumerable<T>> GetChildren; 24 25 public ReingoldTilfordLayoutEngine(Func<T, IEnumerable<T>> GetChildren) { 26 this.GetChildren = GetChildren; 27 } 28 29 public IEnumerable<VisualTreeNode<T>> CalculateLayout(T root) { 30 return CalculateLayout(root, 0, 0); 31 } 32 33 public IEnumerable<VisualTreeNode<T>> CalculateLayout(T root, float width, float height) { 34 Dictionary<T, LayoutNode<T>> layoutNodeMap = new Dictionary<T, LayoutNode<T>>(); 35 var layoutRoot = new LayoutNode<T> { Content = root, Width = NodeWidth, Height = NodeHeight, }; 36 layoutRoot.Ancestor = layoutRoot; 37 Expand(layoutRoot, layoutNodeMap); 38 39 FirstWalk(layoutRoot); 40 SecondWalk(layoutRoot, -layoutRoot.Prelim); 41 NormalizeCoordinates(layoutNodeMap.Values); 42 if (height != 0 && width != 0) { 43 FitToBounds(width, height, layoutNodeMap.Values); 44 Center(width, height, layoutNodeMap.Values); 45 } 46 47 return layoutNodeMap.Values.Select(x => new VisualTreeNode<T>(x.Content) { 48 Width = (int)Math.Round(x.Width), 49 Height = (int)Math.Round(x.Height), 50 X = (int)Math.Round(x.X), 51 Y = (int)Math.Round(x.Y) 52 }); 53 } 54 55 private void Expand(LayoutNode<T> lRoot, Dictionary<T, LayoutNode<T>> map) { 56 map.Add(lRoot.Content, lRoot); 49 57 var children = GetChildren(lRoot.Content).ToList(); 50 58 if (!children.Any()) return; … … 61 69 node.Ancestor = node; 62 70 lRoot.Children.Add(node); 63 Expand(node); 64 } 65 } 66 67 public IEnumerable<T> GetContentNodes() { 68 return nodeMap.Keys; 69 } 70 71 public IEnumerable<VisualTreeNode<T>> GetVisualNodes() { 72 return nodeMap.Values.Select(x => new VisualTreeNode<T>(x.Content) { 73 Width = (int)Math.Round(x.Width), 74 Height = (int)Math.Round(x.Height), 75 X = (int)Math.Round(x.X), 76 Y = (int)Math.Round(x.Y) 77 }); 78 } 79 80 public IEnumerable<LayoutNode<T>> GetLayoutNodes() { 81 return nodeMap.Values; 82 } 83 84 public void AddNode(T content) { 85 if (nodeMap.ContainsKey(content)) { throw new ArgumentException("Content already present in the dictionary."); } 86 var node = new LayoutNode<T> { Content = content }; 87 nodeMap.Add(content, node); 88 } 89 90 public void AddNode(LayoutNode<T> node) { 91 var content = node.Content; 92 if (nodeMap.ContainsKey(content)) { throw new ArgumentException("Content already present in the dictionary."); } 93 nodeMap.Add(content, node); 94 } 95 96 public void AddNodes(IEnumerable<LayoutNode<T>> nodes) { 97 foreach (var node in nodes) 98 nodeMap.Add(node.Content, node); 99 } 100 101 public LayoutNode<T> GetNode(T content) { 102 LayoutNode<T> layoutNode; 103 nodeMap.TryGetValue(content, out layoutNode); 104 return layoutNode; 105 } 106 107 public void ResetCoordinates() { 108 foreach (var node in nodeMap.Values) { 109 node.ResetCoordinates(); 110 } 111 } 112 113 public Dictionary<T, PointF> GetCoordinates() { 114 return nodeMap.ToDictionary(x => x.Key, x => new PointF(x.Value.X, x.Value.Y)); 115 } 71 Expand(node, map); 72 } 73 } 74 116 75 117 76 /// <summary> 118 77 /// Transform LayoutNode coordinates so that all coordinates are positive and start from (0,0) 119 78 /// </summary> 120 private void NormalizeCoordinates() { 121 var nodes = nodeMap.Values.ToList(); 79 private static void NormalizeCoordinates(IEnumerable<LayoutNode<T>> nodes) { 122 80 float xmin = 0, ymin = 0; 123 81 foreach (var node in nodes) { … … 131 89 } 132 90 133 p ublic void Center(float width, float height) {91 private void Center(float width, float height, IEnumerable<LayoutNode<T>> nodes) { 134 92 // center layout on screen 135 var bounds = Bounds( );93 var bounds = Bounds(nodes); 136 94 float dx = 0, dy = 0; 137 95 if (width > bounds.Width) { dx = (width - bounds.Width) / 2f; } 138 96 if (height > bounds.Height) { dy = (height - bounds.Height) / 2f; } 139 foreach (var node in node Map.Values) { node.Translate(dx, dy); }140 } 141 142 p ublic void FitToBounds(float width, float height) {143 var bounds = Bounds( );97 foreach (var node in nodes) { node.Translate(dx, dy); } 98 } 99 100 private void FitToBounds(float width, float height, IEnumerable<LayoutNode<T>> nodes) { 101 var bounds = Bounds(nodes); 144 102 var myWidth = bounds.Width; 145 103 var myHeight = bounds.Height; … … 147 105 if (myWidth <= width && myHeight <= height) return; // no need to fit since we are within bounds 148 106 149 var layers = node Map.Values.GroupBy(node => node.Level, node => node).ToList();107 var layers = nodes.GroupBy(node => node.Level, node => node).ToList(); 150 108 151 109 if (myWidth > width) { … … 158 116 float spacing = minHorizontalSpacing * x; 159 117 foreach (var layer in layers) { 160 var nodes = layer.ToList();118 var nodesLayer = layer.ToList(); 161 119 float minWidth = float.MaxValue; 162 for (int i = 0; i < nodes .Count - 1; ++i) { minWidth = Math.Min(minWidth, nodes[i + 1].X - nodes[i].X); }120 for (int i = 0; i < nodesLayer.Count - 1; ++i) { minWidth = Math.Min(minWidth, nodesLayer[i + 1].X - nodesLayer[i].X); } 163 121 float w = Math.Min(NodeWidth, minWidth - spacing); 164 foreach (var node in nodes ) {122 foreach (var node in nodesLayer) { 165 123 node.X += (node.Width - w) / 2f; 166 124 node.Width = w; … … 186 144 } 187 145 188 public void Clear() {189 layoutRoot = null;190 nodeMap.Clear();191 }192 193 public void Reset() {194 foreach (var layoutNode in nodeMap.Values) {195 // reset layout-related parameters196 layoutNode.Reset();197 // reset the width and height since they might have been affected by scaling198 layoutNode.Width = NodeWidth;199 layoutNode.Height = NodeHeight;200 }201 }202 203 public void CalculateLayout() {204 if (layoutRoot == null) throw new Exception("Layout layoutRoot cannot be null.");205 Reset(); // reset node parameters like Mod, Shift etc. and set coordinates to 0206 FirstWalk(layoutRoot);207 SecondWalk(layoutRoot, -layoutRoot.Prelim);208 NormalizeCoordinates();209 }210 211 public void CalculateLayout(float width, float height) {212 CalculateLayout();213 FitToBounds(width, height);214 Center(width, height);215 }216 146 217 147 /// <summary> … … 219 149 /// </summary> 220 150 /// <returns></returns> 221 p ublic RectangleF Bounds() {151 private RectangleF Bounds(IEnumerable<LayoutNode<T>> nodes) { 222 152 float xmin = 0, xmax = 0, ymin = 0, ymax = 0; 223 var list = nodeMap.Values.ToList(); 224 foreach (LayoutNode<T> node in list) { 153 foreach (LayoutNode<T> node in nodes) { 225 154 float x = node.X, y = node.Y; 226 155 if (xmin > x) xmin = x; -
trunk/sources/HeuristicLab.Encodings.SymbolicExpressionTreeEncoding.Views/3.4/SymbolicExpressionTreeChart.cs
r10561 r10565 27 27 using System.Linq; 28 28 using System.Windows.Forms; 29 using Point = System.Drawing.Point; 29 30 30 31 31 namespace HeuristicLab.Encodings.SymbolicExpressionTreeEncoding.Views { … … 50 50 this.backgroundColor = Color.White; 51 51 this.textFont = new Font(FontFamily.GenericSansSerif, 12); 52 layoutEngine = new ReingoldTilfordLayoutEngine<ISymbolicExpressionTreeNode> { 52 53 visualTreeNodes = new Dictionary<ISymbolicExpressionTreeNode, VisualTreeNode<ISymbolicExpressionTreeNode>>(); 54 visualLines = new Dictionary<Tuple<ISymbolicExpressionTreeNode, ISymbolicExpressionTreeNode>, VisualTreeNodeConnection>(); 55 56 layoutEngine = new ReingoldTilfordLayoutEngine<ISymbolicExpressionTreeNode>(n => n.Subtrees) { 53 57 NodeWidth = preferredNodeWidth, 54 58 NodeHeight = preferredNodeHeight, … … 56 60 VerticalSpacing = minVerticalDistance 57 61 }; 58 } 59 60 private ILayoutEngine<ISymbolicExpressionTreeNode> TreeLayoutEngine { 61 get { return layoutEngine; } 62 set { 63 layoutEngine = value; 64 InitializeLayout(); 65 Repaint(); 66 } 67 } 62 reingoldTilfordToolStripMenuItem.Checked = true; 63 } 64 65 //private ILayoutEngine<ISymbolicExpressionTreeNode> TreeLayoutEngine { 66 // get { return layoutEngine; } 67 // set { 68 // layoutEngine = value; 69 // InitializeLayout(); 70 // Repaint(); 71 // } 72 //} 68 73 69 74 public SymbolicExpressionTreeChart(ISymbolicExpressionTree tree) … … 114 119 set { 115 120 tree = value; 116 if (tree != null) { 117 //the layout engine needs to be initialized here so that the visualNodes and the visualLines dictionaries are populated 118 InitializeLayout(); 119 Repaint(); 120 } 121 Repaint(); 121 122 } 122 123 } … … 285 286 #endregion 286 287 287 #region initialize the layout 288 private void InitializeLayout() { 288 private void CalculateLayout(int preferredWidth, int preferredHeight, int minHDistance, int minVDistance) { 289 layoutEngine.NodeWidth = preferredWidth; 290 layoutEngine.NodeHeight = preferredHeight; 291 layoutEngine.HorizontalSpacing = minHDistance; 292 layoutEngine.VerticalSpacing = minVDistance; 293 289 294 var actualRoot = tree.Root; 290 295 if (actualRoot.Symbol is ProgramRootSymbol && actualRoot.SubtreeCount == 1) { 291 296 actualRoot = tree.Root.GetSubtree(0); 292 297 } 293 layoutEngine.Initialize(actualRoot, n => n.Subtrees, n => n.GetLength(), n => n.GetDepth()); 294 layoutEngine.CalculateLayout(this.Width, this.Height); 295 UpdateDictionaries(); 296 } 297 298 private void UpdateDictionaries() { 299 var visualNodes = layoutEngine.GetVisualNodes().ToList(); 300 //populate the visual nodes and visual connections dictionaries 298 299 var visualNodes = layoutEngine.CalculateLayout(actualRoot, Width, Height).ToList(); 301 300 visualTreeNodes = visualNodes.ToDictionary(x => x.Content, x => x); 302 301 visualLines = new Dictionary<Tuple<ISymbolicExpressionTreeNode, ISymbolicExpressionTreeNode>, VisualTreeNodeConnection>(); … … 307 306 } 308 307 } 309 #endregion 308 310 309 #region methods for painting the symbolic expression tree 311 310 private void DrawFunctionTree(Graphics graphics, int preferredWidth, int preferredHeight, int minHDistance, int minVDistance) { 312 //we assume here that the layout has already been initialized when the symbolic expression tree was changed 313 //recalculate layout according to new node widths and spacing 314 layoutEngine.NodeWidth = preferredWidth; 315 layoutEngine.NodeHeight = preferredHeight; 316 layoutEngine.HorizontalSpacing = minHDistance; 317 layoutEngine.VerticalSpacing = minVDistance; 318 layoutEngine.CalculateLayout(Width, Height); 319 UpdateDictionaries();//this will reset the visual nodes, therefore colors will be reset to default values 311 CalculateLayout(preferredWidth, preferredHeight, minHDistance, minVDistance); 320 312 var visualNodes = visualTreeNodes.Values; 321 313 //draw nodes and connections … … 420 412 421 413 private void reingoldTilfordToolStripMenuItem_Click(object sender, EventArgs e) { 422 TreeLayoutEngine = new ReingoldTilfordLayoutEngine<ISymbolicExpressionTreeNode>{414 layoutEngine = new ReingoldTilfordLayoutEngine<ISymbolicExpressionTreeNode>(n => n.Subtrees) { 423 415 NodeWidth = preferredNodeWidth, 424 416 NodeHeight = preferredNodeHeight, … … 426 418 VerticalSpacing = minVerticalDistance 427 419 }; 420 reingoldTilfordToolStripMenuItem.Checked = true; 421 boxesToolStripMenuItem.Checked = false; 422 Repaint(); 428 423 } 429 424 430 425 private void boxesToolStripMenuItem_Click(object sender, EventArgs e) { 431 TreeLayoutEngine = new BoxesLayoutEngine<ISymbolicExpressionTreeNode>{426 layoutEngine = new BoxesLayoutEngine<ISymbolicExpressionTreeNode>(n => n.Subtrees, n => n.GetLength(), n => n.GetDepth()) { 432 427 NodeWidth = preferredNodeWidth, 433 428 NodeHeight = preferredNodeHeight, … … 435 430 VerticalSpacing = minVerticalDistance 436 431 }; 432 reingoldTilfordToolStripMenuItem.Checked = false; 433 boxesToolStripMenuItem.Checked = true; 434 Repaint(); 437 435 } 438 436 }
Note: See TracChangeset
for help on using the changeset viewer.