原书出处
Introduction to Algorithms, Fourth Edition
19 第19章 不相交集合的数据结构
f which are MAKE-TREE operations. 19-3 Tarjan’s offline lowest-common-ancestors algorithm
The lowest common ancestor of two nodes u and v in a rooted tree T is the node w that is an ancestor of both u and v and that has the greatest depth in T.
In the offline lowest-common-ancestors problem, you are given a rooted tree T and an arbi
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter019.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea