title: What are the step to the Reingold-Tilford algorithm and how might I program it?
body: <p>From the presentation: <a href="http://hci.stanford.edu/courses/cs448b/f09/lectures/CS448B-20091021-GraphsAndTrees.pdf" rel="noreferrer">Graphs and Trees</a> on page 3, there is a visual presentation of what takes place during the Reigngold-Tilford process; it also gives a vague summary to this algorithm before hand: <code>"...starts with bottom-up pass of the tree;
  [finishes with] Top-down pass for assignment of final positions..."</code> I can achieve both directional passes through recursive means, and I know that the Y-value(s) are respective to each node's generation level, but I'm still lost as to how the X-coordinates are solved.</p>
  
  <p>I did come across this project: <a href="http://www.codeproject.com/Articles/29518/A-Graph-Tree-Drawing-Control-for-WPF" rel="noreferrer">A Graph Tree Drawing Control for WPF</a> but there is so much code I had great difficulty locating what should be a simple 2-3 methods to define the X-values. (Also have no experience with WPF as well) </p>
  
  <p>I have been searching and experimenting how to do this for several days now, so your help is much appreciated!</p>