<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="144,5,297,45"/>
<area shape="rect" id="node2" title=" " alt="" coords="5,93,71,119"/>
<area shape="rect" id="node3" title=" " alt="" coords="95,93,167,119"/>
<area shape="rect" id="node4" title=" " alt="" coords="192,93,249,119"/>
<area shape="rect" id="node5" title=" " alt="" coords="274,93,327,119"/>
<area shape="rect" id="node6" title=" " alt="" coords="351,93,410,119"/>
</map>
