title: Finding Center of The Tree
body: <p>I have a question which is part of my program.</p>
  
  <p>For a tree T=(V,E) we need to find the node v in the tree that minimize the length of the longest path from v to any other node. </p>
  
  <p>so how we find the center of the tree? Is there can be only one center or more?</p>
  
  <p>If anyone can give me good algorithm for this so i can get the idea on how i can fit into my program.</p>