algorithms/fds/8 #44
algorithms/fds/8
#44
giscus[bot]
bot
Replies: 1 comment 1 reply
-
|
前辈你好，我有一个疑问：你在5path中认为：union-by-rank与path-compression不兼容。但应用两者，可以达到接近常数级的时间复杂度啊？ |
Beta Was this translation helpful? Give feedback.
1 reply
-
|
因为路径压缩会改变树的高度，所以这个高度字段就没有什么卵用了——一压缩后，它里面的信息就变成 stale 的了 |
Beta Was this translation helpful? Give feedback.
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Uh oh!
There was an error while loading. Please reload this page.
-
algorithms/fds/8
NoughtQ的笔记本，主要记录一些 CS 相关的笔记
https://note.noughtq.top/algorithms/fds/8
Beta Was this translation helpful? Give feedback.
All reactions