TreeLayout.cs 6.5 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187
  1. namespace Tree
  2. {
  3. public class TreeLayout
  4. {
  5. private readonly TreeViewModel treeViewModel;
  6. private const double XGap = 20;
  7. private const double YGap = 10;
  8. private double rootOrigX;
  9. private double rootOrigY;
  10. private double rootOffsetX;
  11. private double rootOffsetY;
  12. public TreeLayout(TreeViewModel treeViewModel)
  13. {
  14. this.treeViewModel = treeViewModel;
  15. }
  16. private TreeNodeViewModel LeftMostOffspring(
  17. TreeNodeViewModel treeNode, int currentLevel, int searchLevel)
  18. {
  19. if (currentLevel == searchLevel)
  20. {
  21. return treeNode;
  22. }
  23. for (int i = 0; i < treeNode.Children.Count; ++i)
  24. {
  25. var child = this.treeViewModel.Get(treeNode.Children[i]);
  26. child.AncestorModify = treeNode.Modify + treeNode.AncestorModify;
  27. var offspring = LeftMostOffspring(child, currentLevel + 1, searchLevel);
  28. if (offspring == null)
  29. {
  30. continue;
  31. }
  32. return offspring;
  33. }
  34. return null;
  35. }
  36. private TreeNodeViewModel RightMostOffspring(
  37. TreeNodeViewModel treeNode, int currentLevel, int searchLevel)
  38. {
  39. if (currentLevel == searchLevel)
  40. {
  41. return treeNode;
  42. }
  43. for (int i = treeNode.Children.Count - 1; i >= 0; --i)
  44. {
  45. var child = this.treeViewModel.Get(treeNode.Children[i]);
  46. child.AncestorModify = treeNode.Modify + treeNode.AncestorModify;
  47. var offspring = RightMostOffspring(child, currentLevel + 1, searchLevel);
  48. if (offspring == null)
  49. {
  50. continue;
  51. }
  52. return offspring;
  53. }
  54. return null;
  55. }
  56. private void AjustSubTreeGap(TreeNodeViewModel left, TreeNodeViewModel right)
  57. {
  58. double offset = 0;
  59. TreeNodeViewModel tLeft = left;
  60. TreeNodeViewModel tRight = right;
  61. left.AncestorModify = 0;
  62. right.AncestorModify = 0;
  63. for (int i = 0; tLeft != null && tRight != null; ++i)
  64. {
  65. double tGap = (tRight.Prelim + tRight.AncestorModify) -
  66. (tLeft.Prelim + tLeft.AncestorModify);
  67. if (XGap + TreeNodeViewModel.Width - tGap > offset)
  68. {
  69. offset = XGap + TreeNodeViewModel.Width - tGap;
  70. }
  71. tLeft = RightMostOffspring(left, 0, i + 1);
  72. tRight = LeftMostOffspring(right, 0, i + 1);
  73. }
  74. right.Modify += offset;
  75. right.Prelim += offset;
  76. }
  77. private void AjustTreeGap(TreeNodeViewModel treeNode)
  78. {
  79. for (int i = 0; i < treeNode.Children.Count - 1; ++i)
  80. {
  81. for (int j = i + 1; j < treeNode.Children.Count; ++j)
  82. {
  83. var left = this.treeViewModel.Get(treeNode.Children[i]);
  84. var right = this.treeViewModel.Get(treeNode.Children[j]);
  85. AjustSubTreeGap(left, right);
  86. }
  87. }
  88. }
  89. private void CalculatePrelimAndModify(TreeNodeViewModel treeNode)
  90. {
  91. foreach (int childId in treeNode.Children)
  92. {
  93. TreeNodeViewModel child = this.treeViewModel.Get(childId);
  94. CalculatePrelimAndModify(child);
  95. }
  96. double prelim = 0;
  97. double modify = 0;
  98. if (treeNode.IsLeaf)
  99. {
  100. if (treeNode.LeftSibling == null)
  101. {
  102. // 如果没有左邻居,不需要设置modify
  103. prelim = 0;
  104. }
  105. else
  106. {
  107. prelim = treeNode.LeftSibling.Prelim + TreeNodeViewModel.Width + XGap;
  108. }
  109. }
  110. else
  111. {
  112. // 调整子树间的间距
  113. AjustTreeGap(treeNode);
  114. double childrenCenter = (treeNode.FirstChild.Prelim + treeNode.LastChild.Prelim) / 2;
  115. if (treeNode.LeftSibling == null)
  116. {
  117. // 如果没有左邻居,不需要设置modify
  118. prelim = childrenCenter;
  119. }
  120. else
  121. {
  122. prelim = treeNode.LeftSibling.Prelim + TreeNodeViewModel.Width + XGap;
  123. modify = prelim - childrenCenter;
  124. }
  125. }
  126. treeNode.Prelim = prelim;
  127. treeNode.Modify = modify;
  128. // Log.Debug("Id: " + treeNode.Id + " Prelim: " + treeNode.Prelim + " Modify: " +
  129. // treeNode.Modify);
  130. }
  131. private void CalculateRelativeXAndY(
  132. TreeNodeViewModel treeNode, int level, double totalModify)
  133. {
  134. foreach (int childId in treeNode.Children)
  135. {
  136. TreeNodeViewModel child = this.treeViewModel.Get(childId);
  137. CalculateRelativeXAndY(child, level + 1, treeNode.Modify + totalModify);
  138. }
  139. if (treeNode.IsLeaf)
  140. {
  141. treeNode.X = treeNode.Prelim + totalModify;
  142. }
  143. else
  144. {
  145. treeNode.X = (treeNode.FirstChild.X + treeNode.LastChild.X) / 2;
  146. }
  147. treeNode.Y = level * (TreeNodeViewModel.Height + YGap);
  148. }
  149. private void FixXAndY(TreeNodeViewModel treeNode)
  150. {
  151. treeNode.X += rootOffsetX;
  152. treeNode.Y += rootOffsetY;
  153. foreach (var childId in treeNode.Children)
  154. {
  155. TreeNodeViewModel child = this.treeViewModel.Get(childId);
  156. FixXAndY(child);
  157. }
  158. }
  159. public void ExcuteLayout(TreeNodeViewModel root)
  160. {
  161. if (root == null)
  162. {
  163. return;
  164. }
  165. rootOrigX = root.X;
  166. rootOrigY = root.Y;
  167. CalculatePrelimAndModify(root);
  168. CalculateRelativeXAndY(root, 0, 0);
  169. rootOffsetX = rootOrigX - root.X;
  170. rootOffsetY = rootOrigY - root.Y;
  171. FixXAndY(root);
  172. }
  173. }
  174. }