title: Lowest Common Ancestor (boost graph)
body: <p>Is there a built-in method in boost to find the lowest common ancestor of two or more nodes in a tree (which is a boost::graph instance)?</p>
  
  <p>If not, I would appreciate suggestions on the best way to do this. <a href="http://en.wikipedia.org/wiki/Lowest_common_ancestor" rel="nofollow">Wikipedia claims</a> there are efficient algorithm to achieve this in O(1) time (with O(n) pre-processing), but it doesn't describe the algorithms.</p>