<map id="graph/lowest_common_ancestor.cpp" name="graph/lowest_common_ancestor.cpp">
<area shape="rect" id="node1" title="Data structure for finding the lowest common ancestor of two vertices in a rooted tree using binary l..." alt="" coords="131,5,285,47"/>
<area shape="rect" id="node2" title=" " alt="" coords="5,95,77,121"/>
<area shape="rect" id="node3" title=" " alt="" coords="101,95,155,121"/>
<area shape="rect" id="node4" title=" " alt="" coords="179,95,237,121"/>
<area shape="rect" id="node5" title=" " alt="" coords="262,95,319,121"/>
<area shape="rect" id="node6" title=" " alt="" coords="343,95,409,121"/>
</map>
