Lowest Common Ancestor (LCA) of two nodes in graph
In graph
theory and computer
science, the lowest common ancestor (LCA)
of two nodes v and w in
a tree or directed
acyclic graph (DAG) is the lowest (i.e. deepest) node that has both v and w
原创
2014-12-30 14:01:28 ·
773 阅读 ·
0 评论